/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 INSUFFICIENT_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/rfi008.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:14:56,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:14:56,784 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 15:14:56,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:14:56,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:14:56,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:14:56,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:14:56,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:14:56,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:14:56,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:14:56,814 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:14:56,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:14:56,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:14:56,815 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:14:56,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:14:56,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:14:56,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:14:56,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:14:56,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:14:56,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:14:56,817 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:14:56,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:14:56,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:14:56,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:14:56,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:14:56,821 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:14:56,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:14:56,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:56,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:14:56,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:14:56,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:14:56,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:14:56,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:14:56,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:14:56,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:14:56,824 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 -> INSUFFICIENT_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 15:14:57,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:14:57,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:14:57,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:14:57,162 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:14:57,162 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:14:57,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-26 15:14:58,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:14:58,541 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:14:58,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-26 15:14:58,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b14cc13/7c5187099e834d599ac97a34afdb96a8/FLAGa1cd89418 [2023-08-26 15:14:58,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b14cc13/7c5187099e834d599ac97a34afdb96a8 [2023-08-26 15:14:58,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:14:58,577 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:14:58,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:58,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:14:58,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:14:58,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:58" (1/1) ... [2023-08-26 15:14:58,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd761b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:58, skipping insertion in model container [2023-08-26 15:14:58,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:58" (1/1) ... [2023-08-26 15:14:58,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:14:58,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:58,999 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:14:59,027 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:14:59,028 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:14:59,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:59,120 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:59,120 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:59,127 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:14:59,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59 WrapperNode [2023-08-26 15:14:59,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:59,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:59,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:14:59,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:14:59,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,196 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-08-26 15:14:59,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:59,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:14:59,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:14:59,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:14:59,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:14:59,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:14:59,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:14:59,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:14:59,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (1/1) ... [2023-08-26 15:14:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:14:59,275 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 15:14:59,281 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 15:14:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:14:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:14:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:14:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:14:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:14:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:14:59,306 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 15:14:59,452 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:14:59,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:14:59,806 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:14:59,916 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:14:59,916 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:14:59,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:59 BoogieIcfgContainer [2023-08-26 15:14:59,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:14:59,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:14:59,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:14:59,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:14:59,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:14:58" (1/3) ... [2023-08-26 15:14:59,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb75045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:59, skipping insertion in model container [2023-08-26 15:14:59,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:59" (2/3) ... [2023-08-26 15:14:59,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb75045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:59, skipping insertion in model container [2023-08-26 15:14:59,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:59" (3/3) ... [2023-08-26 15:14:59,924 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2023-08-26 15:14:59,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:14:59,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:14:59,938 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:14:59,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:15:00,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 100 transitions, 210 flow [2023-08-26 15:15:00,053 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-08-26 15:15:00,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:00,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:15:00,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 100 transitions, 210 flow [2023-08-26 15:15:00,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 98 transitions, 202 flow [2023-08-26 15:15:00,064 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:15:00,075 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 98 transitions, 202 flow [2023-08-26 15:15:00,078 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 98 transitions, 202 flow [2023-08-26 15:15:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 202 flow [2023-08-26 15:15:00,113 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-08-26 15:15:00,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:00,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:15:00,116 INFO L119 LiptonReduction]: Number of co-enabled transitions 1360 [2023-08-26 15:15:03,301 INFO L134 LiptonReduction]: Checked pairs total: 3872 [2023-08-26 15:15:03,302 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-26 15:15:03,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:15:03,318 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;@1c7c874e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:15:03,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:15:03,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:15:03,320 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:15:03,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:03,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:03,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:15:03,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:03,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 1 times [2023-08-26 15:15:03,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351475765] [2023-08-26 15:15:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:03,417 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 15:15:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351475765] [2023-08-26 15:15:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351475765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:15:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284207035] [2023-08-26 15:15:03,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:03,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:15:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:15:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:15:03,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-08-26 15:15:03,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:03,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-08-26 15:15:03,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:03,615 INFO L124 PetriNetUnfolderBase]: 275/475 cut-off events. [2023-08-26 15:15:03,615 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 15:15:03,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 475 events. 275/475 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1909 event pairs, 275 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 951. Up to 469 conditions per place. [2023-08-26 15:15:03,621 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-26 15:15:03,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-26 15:15:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:15:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:15:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-26 15:15:03,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48284313725490197 [2023-08-26 15:15:03,636 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-26 15:15:03,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-26 15:15:03,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:03,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-26 15:15:03,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,650 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,651 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 197 transitions. [2023-08-26 15:15:03,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-26 15:15:03,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:03,655 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-26 15:15:03,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-26 15:15:03,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-26 15:15:03,659 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-26 15:15:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:03,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:15:03,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:15:03,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:03,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 497216, now seen corresponding path program 1 times [2023-08-26 15:15:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127371678] [2023-08-26 15:15:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:03,886 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 15:15:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127371678] [2023-08-26 15:15:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127371678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:03,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:15:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115948935] [2023-08-26 15:15:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:03,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:03,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-08-26 15:15:03,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:03,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:03,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-08-26 15:15:03,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:03,984 INFO L124 PetriNetUnfolderBase]: 224/418 cut-off events. [2023-08-26 15:15:03,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:03,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 418 events. 224/418 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1937 event pairs, 20 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 815. Up to 333 conditions per place. [2023-08-26 15:15:03,990 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-26 15:15:03,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 122 flow [2023-08-26 15:15:03,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-26 15:15:03,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46895424836601307 [2023-08-26 15:15:03,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-26 15:15:03,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-26 15:15:03,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:03,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-26 15:15:03,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,001 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 287 transitions. [2023-08-26 15:15:04,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 122 flow [2023-08-26 15:15:04,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:15:04,003 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-26 15:15:04,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-26 15:15:04,006 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-26 15:15:04,006 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-26 15:15:04,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:04,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:04,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:15:04,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:04,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1298548447, now seen corresponding path program 1 times [2023-08-26 15:15:04,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283543164] [2023-08-26 15:15:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:04,233 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 15:15:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283543164] [2023-08-26 15:15:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283543164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:04,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:15:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601091523] [2023-08-26 15:15:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:15:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:15:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:15:04,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 204 [2023-08-26 15:15:04,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:04,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 204 [2023-08-26 15:15:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:04,383 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-08-26 15:15:04,383 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-26 15:15:04,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 508 events. 287/508 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1973 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1065. Up to 417 conditions per place. [2023-08-26 15:15:04,386 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-26 15:15:04,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 41 transitions, 180 flow [2023-08-26 15:15:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:15:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:15:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2023-08-26 15:15:04,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245098039215686 [2023-08-26 15:15:04,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 433 transitions. [2023-08-26 15:15:04,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 433 transitions. [2023-08-26 15:15:04,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:04,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 433 transitions. [2023-08-26 15:15:04,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,392 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 433 transitions. [2023-08-26 15:15:04,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 41 transitions, 180 flow [2023-08-26 15:15:04,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:04,393 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-26 15:15:04,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-26 15:15:04,394 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-26 15:15:04,395 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-26 15:15:04,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:04,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:15:04,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:04,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -402981472, now seen corresponding path program 1 times [2023-08-26 15:15:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:04,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488332936] [2023-08-26 15:15:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:04,652 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 15:15:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488332936] [2023-08-26 15:15:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488332936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:15:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053254880] [2023-08-26 15:15:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:04,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:15:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:15:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:15:04,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 204 [2023-08-26 15:15:04,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:04,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 204 [2023-08-26 15:15:04,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:04,783 INFO L124 PetriNetUnfolderBase]: 253/446 cut-off events. [2023-08-26 15:15:04,784 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-26 15:15:04,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 446 events. 253/446 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1622 event pairs, 83 based on Foata normal form. 24/470 useless extension candidates. Maximal degree in co-relation 1087. Up to 305 conditions per place. [2023-08-26 15:15:04,786 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 23 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2023-08-26 15:15:04,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 185 flow [2023-08-26 15:15:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:15:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:15:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2023-08-26 15:15:04,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2023-08-26 15:15:04,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2023-08-26 15:15:04,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2023-08-26 15:15:04,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:04,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2023-08-26 15:15:04,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,792 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 5 states and 429 transitions. [2023-08-26 15:15:04,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 185 flow [2023-08-26 15:15:04,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 176 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:04,795 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 75 flow [2023-08-26 15:15:04,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-26 15:15:04,796 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-26 15:15:04,796 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 75 flow [2023-08-26 15:15:04,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:04,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:04,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:15:04,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:04,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 575174518, now seen corresponding path program 1 times [2023-08-26 15:15:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529818441] [2023-08-26 15:15:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:04,943 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 15:15:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529818441] [2023-08-26 15:15:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529818441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:15:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410385079] [2023-08-26 15:15:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:04,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:15:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:15:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:15:04,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 204 [2023-08-26 15:15:04,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:04,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:04,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 204 [2023-08-26 15:15:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:05,094 INFO L124 PetriNetUnfolderBase]: 225/402 cut-off events. [2023-08-26 15:15:05,094 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-08-26 15:15:05,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 402 events. 225/402 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1437 event pairs, 123 based on Foata normal form. 24/426 useless extension candidates. Maximal degree in co-relation 1010. Up to 277 conditions per place. [2023-08-26 15:15:05,096 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 25 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2023-08-26 15:15:05,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 205 flow [2023-08-26 15:15:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:15:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:15:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-08-26 15:15:05,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42254901960784313 [2023-08-26 15:15:05,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-08-26 15:15:05,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-08-26 15:15:05,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:05,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-08-26 15:15:05,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,102 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 75 flow. Second operand 5 states and 431 transitions. [2023-08-26 15:15:05,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 205 flow [2023-08-26 15:15:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 191 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 15:15:05,104 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-26 15:15:05,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-26 15:15:05,105 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-26 15:15:05,105 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-26 15:15:05,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:05,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:15:05,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:05,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1879751789, now seen corresponding path program 1 times [2023-08-26 15:15:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:05,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941447869] [2023-08-26 15:15:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:05,249 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 15:15:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941447869] [2023-08-26 15:15:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941447869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:15:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764456798] [2023-08-26 15:15:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:05,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:15:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:15:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:15:05,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-08-26 15:15:05,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:05,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-08-26 15:15:05,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:05,350 INFO L124 PetriNetUnfolderBase]: 85/186 cut-off events. [2023-08-26 15:15:05,351 INFO L125 PetriNetUnfolderBase]: For 88/89 co-relation queries the response was YES. [2023-08-26 15:15:05,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 186 events. 85/186 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 684 event pairs, 17 based on Foata normal form. 28/213 useless extension candidates. Maximal degree in co-relation 471. Up to 77 conditions per place. [2023-08-26 15:15:05,352 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 24 selfloop transitions, 3 changer transitions 18/48 dead transitions. [2023-08-26 15:15:05,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 246 flow [2023-08-26 15:15:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:15:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:15:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2023-08-26 15:15:05,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-26 15:15:05,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2023-08-26 15:15:05,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2023-08-26 15:15:05,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:05,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2023-08-26 15:15:05,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,357 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,357 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 5 states and 450 transitions. [2023-08-26 15:15:05,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 246 flow [2023-08-26 15:15:05,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 226 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 15:15:05,358 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 93 flow [2023-08-26 15:15:05,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=66, 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-26 15:15:05,359 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-26 15:15:05,359 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 93 flow [2023-08-26 15:15:05,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:05,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:05,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:15:05,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:05,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 408634512, now seen corresponding path program 1 times [2023-08-26 15:15:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915962215] [2023-08-26 15:15:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:05,528 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 15:15:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915962215] [2023-08-26 15:15:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915962215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:15:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294334449] [2023-08-26 15:15:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:05,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:15:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:15:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:15:05,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-08-26 15:15:05,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:05,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-08-26 15:15:05,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:05,621 INFO L124 PetriNetUnfolderBase]: 32/87 cut-off events. [2023-08-26 15:15:05,621 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 15:15:05,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 87 events. 32/87 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 13 based on Foata normal form. 9/95 useless extension candidates. Maximal degree in co-relation 250. Up to 41 conditions per place. [2023-08-26 15:15:05,622 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 22 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2023-08-26 15:15:05,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 217 flow [2023-08-26 15:15:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:15:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:15:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2023-08-26 15:15:05,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272875816993464 [2023-08-26 15:15:05,624 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 523 transitions. [2023-08-26 15:15:05,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions. [2023-08-26 15:15:05,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:05,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions. [2023-08-26 15:15:05,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 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 15:15:05,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,627 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,627 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 93 flow. Second operand 6 states and 523 transitions. [2023-08-26 15:15:05,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 217 flow [2023-08-26 15:15:05,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 190 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-26 15:15:05,629 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 92 flow [2023-08-26 15:15:05,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-26 15:15:05,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-26 15:15:05,630 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 92 flow [2023-08-26 15:15:05,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:05,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:05,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:05,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:15:05,631 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:05,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash -860371755, now seen corresponding path program 1 times [2023-08-26 15:15:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:05,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712543279] [2023-08-26 15:15:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:06,713 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 15:15:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712543279] [2023-08-26 15:15:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712543279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:15:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620208245] [2023-08-26 15:15:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:06,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:15:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:15:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:15:06,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 204 [2023-08-26 15:15:06,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:06,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:06,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 204 [2023-08-26 15:15:06,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:06,995 INFO L124 PetriNetUnfolderBase]: 29/95 cut-off events. [2023-08-26 15:15:06,996 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2023-08-26 15:15:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 95 events. 29/95 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 277 event pairs, 3 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 276. Up to 27 conditions per place. [2023-08-26 15:15:06,996 INFO L140 encePairwiseOnDemand]: 195/204 looper letters, 32 selfloop transitions, 11 changer transitions 12/58 dead transitions. [2023-08-26 15:15:06,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 354 flow [2023-08-26 15:15:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:15:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:15:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 863 transitions. [2023-08-26 15:15:07,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38458110516934046 [2023-08-26 15:15:07,003 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 863 transitions. [2023-08-26 15:15:07,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 863 transitions. [2023-08-26 15:15:07,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:07,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 863 transitions. [2023-08-26 15:15:07,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 78.45454545454545) internal successors, (863), 11 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,008 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,009 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 92 flow. Second operand 11 states and 863 transitions. [2023-08-26 15:15:07,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 354 flow [2023-08-26 15:15:07,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 308 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-26 15:15:07,010 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 147 flow [2023-08-26 15:15:07,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-26 15:15:07,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-26 15:15:07,011 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 147 flow [2023-08-26 15:15:07,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:07,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:07,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:15:07,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:07,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1669064689, now seen corresponding path program 2 times [2023-08-26 15:15:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676030121] [2023-08-26 15:15:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:07,509 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 15:15:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676030121] [2023-08-26 15:15:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676030121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:15:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690760830] [2023-08-26 15:15:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:07,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:15:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:15:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:15:07,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 204 [2023-08-26 15:15:07,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 147 flow. Second operand has 9 states, 9 states have (on average 75.0) internal successors, (675), 9 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:07,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 204 [2023-08-26 15:15:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:07,751 INFO L124 PetriNetUnfolderBase]: 51/144 cut-off events. [2023-08-26 15:15:07,751 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-26 15:15:07,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 144 events. 51/144 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 500 event pairs, 9 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 476. Up to 67 conditions per place. [2023-08-26 15:15:07,752 INFO L140 encePairwiseOnDemand]: 194/204 looper letters, 25 selfloop transitions, 4 changer transitions 36/65 dead transitions. [2023-08-26 15:15:07,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 430 flow [2023-08-26 15:15:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:15:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:15:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2023-08-26 15:15:07,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819073083778966 [2023-08-26 15:15:07,755 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 857 transitions. [2023-08-26 15:15:07,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 857 transitions. [2023-08-26 15:15:07,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:07,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 857 transitions. [2023-08-26 15:15:07,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.9090909090909) internal successors, (857), 11 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,763 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,763 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 147 flow. Second operand 11 states and 857 transitions. [2023-08-26 15:15:07,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 430 flow [2023-08-26 15:15:07,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 414 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 15:15:07,766 INFO L231 Difference]: Finished difference. Result has 55 places, 24 transitions, 132 flow [2023-08-26 15:15:07,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=24} [2023-08-26 15:15:07,767 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-08-26 15:15:07,767 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 24 transitions, 132 flow [2023-08-26 15:15:07,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 75.0) internal successors, (675), 9 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:07,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:07,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:15:07,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:07,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1149797853, now seen corresponding path program 3 times [2023-08-26 15:15:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175825063] [2023-08-26 15:15:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:07,927 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 15:15:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175825063] [2023-08-26 15:15:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175825063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:15:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306191078] [2023-08-26 15:15:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:07,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:15:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:15:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:15:07,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 204 [2023-08-26 15:15:07,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 24 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:07,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:07,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 204 [2023-08-26 15:15:07,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:08,026 INFO L124 PetriNetUnfolderBase]: 33/99 cut-off events. [2023-08-26 15:15:08,026 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-08-26 15:15:08,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 99 events. 33/99 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 278 event pairs, 13 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 364. Up to 42 conditions per place. [2023-08-26 15:15:08,027 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 19 selfloop transitions, 1 changer transitions 19/39 dead transitions. [2023-08-26 15:15:08,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 290 flow [2023-08-26 15:15:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:15:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:15:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2023-08-26 15:15:08,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41862745098039217 [2023-08-26 15:15:08,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 427 transitions. [2023-08-26 15:15:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 427 transitions. [2023-08-26 15:15:08,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:08,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 427 transitions. [2023-08-26 15:15:08,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:08,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:08,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:08,032 INFO L175 Difference]: Start difference. First operand has 55 places, 24 transitions, 132 flow. Second operand 5 states and 427 transitions. [2023-08-26 15:15:08,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 290 flow [2023-08-26 15:15:08,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 235 flow, removed 9 selfloop flow, removed 13 redundant places. [2023-08-26 15:15:08,034 INFO L231 Difference]: Finished difference. Result has 41 places, 20 transitions, 87 flow [2023-08-26 15:15:08,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=20} [2023-08-26 15:15:08,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-26 15:15:08,035 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 87 flow [2023-08-26 15:15:08,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:08,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:08,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:08,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:15:08,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:15:08,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1527043567, now seen corresponding path program 4 times [2023-08-26 15:15:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470841164] [2023-08-26 15:15:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:15:08,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:15:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:15:08,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:15:08,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:15:08,137 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:15:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:15:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:15:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:15:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:15:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:15:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:15:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:15:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:15:08,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:15:08,139 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:08,144 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:15:08,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:15:08,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:15:08 BasicIcfg [2023-08-26 15:15:08,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:15:08,182 INFO L158 Benchmark]: Toolchain (without parser) took 9605.93ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 355.5MB in the beginning and 489.4MB in the end (delta: -133.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,182 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory is still 356.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:15:08,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.02ms. Allocated memory is still 379.6MB. Free memory was 355.2MB in the beginning and 331.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.42ms. Allocated memory is still 379.6MB. Free memory was 331.1MB in the beginning and 328.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,183 INFO L158 Benchmark]: Boogie Preprocessor took 37.37ms. Allocated memory is still 379.6MB. Free memory was 328.5MB in the beginning and 326.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,183 INFO L158 Benchmark]: RCFGBuilder took 682.91ms. Allocated memory is still 379.6MB. Free memory was 326.4MB in the beginning and 336.3MB in the end (delta: -9.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,183 INFO L158 Benchmark]: TraceAbstraction took 8261.58ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 335.4MB in the beginning and 489.4MB in the end (delta: -154.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. [2023-08-26 15:15:08,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory is still 356.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 550.02ms. Allocated memory is still 379.6MB. Free memory was 355.2MB in the beginning and 331.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.42ms. Allocated memory is still 379.6MB. Free memory was 331.1MB in the beginning and 328.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.37ms. Allocated memory is still 379.6MB. Free memory was 328.5MB in the beginning and 326.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 682.91ms. Allocated memory is still 379.6MB. Free memory was 326.4MB in the beginning and 336.3MB in the end (delta: -9.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 8261.58ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 335.4MB in the beginning and 489.4MB in the end (delta: -154.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 102 PlacesBefore, 31 PlacesAfterwards, 98 TransitionsBefore, 25 TransitionsAfterwards, 1360 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 3872 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1758, independent: 1615, independent conditional: 0, independent unconditional: 1615, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1758, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 754, unknown conditional: 0, unknown unconditional: 754] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=0, t1721={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1722; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=1, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi008.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 119 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 13 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:15:08,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...