/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:14:37,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:14:37,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:14:37,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:14:37,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:14:37,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:14:37,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:14:37,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:14:37,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:14:37,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:14:37,206 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:14:37,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:14:37,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:14:37,207 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:14:37,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:14:37,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:14:37,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:14:37,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:14:37,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:14:37,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:14:37,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:14:37,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:14:37,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:14:37,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:14:37,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:14:37,211 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:14:37,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:14:37,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:14:37,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:14:37,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:14:37,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:14:37,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:14:37,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:14:37,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:14:37,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:14:37,214 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:14:37,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:14:37,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:14:37,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:14:37,522 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:14:37,522 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:14:37,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-26 18:14:38,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:14:39,023 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:14:39,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-26 18:14:39,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a032802/bf8be1fdb77f4cc39422ddcc5e45d52d/FLAG3484ee029 [2023-08-26 18:14:39,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a032802/bf8be1fdb77f4cc39422ddcc5e45d52d [2023-08-26 18:14:39,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:14:39,058 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:14:39,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:14:39,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:14:39,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:14:39,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e8dcc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39, skipping insertion in model container [2023-08-26 18:14:39,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:14:39,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:14:39,374 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:14:39,390 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:14:39,392 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:14:39,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:14:39,479 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:14:39,479 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:14:39,485 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:14:39,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39 WrapperNode [2023-08-26 18:14:39,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:14:39,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:14:39,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:14:39,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:14:39,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,554 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2023-08-26 18:14:39,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:14:39,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:14:39,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:14:39,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:14:39,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:14:39,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:14:39,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:14:39,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:14:39,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (1/1) ... [2023-08-26 18:14:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:14:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:14:39,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:14:39,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:14:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:14:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:14:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:14:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:14:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:14:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:14:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:14:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:14:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:14:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:14:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:14:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:14:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:14:39,652 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:14:39,813 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:14:39,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:14:40,093 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:14:40,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:14:40,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:14:40,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:14:40 BoogieIcfgContainer [2023-08-26 18:14:40,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:14:40,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:14:40,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:14:40,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:14:40,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:14:39" (1/3) ... [2023-08-26 18:14:40,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:14:40, skipping insertion in model container [2023-08-26 18:14:40,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:39" (2/3) ... [2023-08-26 18:14:40,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:14:40, skipping insertion in model container [2023-08-26 18:14:40,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:14:40" (3/3) ... [2023-08-26 18:14:40,229 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-08-26 18:14:40,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:14:40,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 18:14:40,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:14:40,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:14:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 218 flow [2023-08-26 18:14:40,344 INFO L124 PetriNetUnfolderBase]: 3/102 cut-off events. [2023-08-26 18:14:40,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:40,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-26 18:14:40,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 218 flow [2023-08-26 18:14:40,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 102 transitions, 210 flow [2023-08-26 18:14:40,354 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:14:40,361 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 102 transitions, 210 flow [2023-08-26 18:14:40,364 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 102 transitions, 210 flow [2023-08-26 18:14:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 210 flow [2023-08-26 18:14:40,384 INFO L124 PetriNetUnfolderBase]: 3/102 cut-off events. [2023-08-26 18:14:40,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:40,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-26 18:14:40,386 INFO L119 LiptonReduction]: Number of co-enabled transitions 1538 [2023-08-26 18:14:43,750 INFO L134 LiptonReduction]: Checked pairs total: 4331 [2023-08-26 18:14:43,751 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-26 18:14:43,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:14:43,767 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;@7b445a05, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:14:43,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 18:14:43,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:14:43,768 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:14:43,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:43,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:43,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:14:43,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:14:43,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 481, now seen corresponding path program 1 times [2023-08-26 18:14:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160431796] [2023-08-26 18:14:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160431796] [2023-08-26 18:14:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160431796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:14:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573844649] [2023-08-26 18:14:43,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:43,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:14:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:14:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:14:43,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-08-26 18:14:43,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:43,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:43,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-08-26 18:14:43,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:44,006 INFO L124 PetriNetUnfolderBase]: 322/547 cut-off events. [2023-08-26 18:14:44,007 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 18:14:44,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 547 events. 322/547 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2245 event pairs, 322 based on Foata normal form. 30/469 useless extension candidates. Maximal degree in co-relation 1096. Up to 544 conditions per place. [2023-08-26 18:14:44,011 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-26 18:14:44,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-26 18:14:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:14:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:14:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2023-08-26 18:14:44,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024154589371981 [2023-08-26 18:14:44,024 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 208 transitions. [2023-08-26 18:14:44,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 208 transitions. [2023-08-26 18:14:44,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:44,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 208 transitions. [2023-08-26 18:14:44,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 104.0) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,033 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,034 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 208 transitions. [2023-08-26 18:14:44,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-26 18:14:44,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:44,038 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-26 18:14:44,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-26 18:14:44,042 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-26 18:14:44,042 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-26 18:14:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:44,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:14:44,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:14:44,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:14:44,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 474347, now seen corresponding path program 1 times [2023-08-26 18:14:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796369980] [2023-08-26 18:14:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796369980] [2023-08-26 18:14:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796369980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:44,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:14:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161939334] [2023-08-26 18:14:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:44,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:14:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:14:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:14:44,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 207 [2023-08-26 18:14:44,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:44,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 207 [2023-08-26 18:14:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:44,423 INFO L124 PetriNetUnfolderBase]: 249/514 cut-off events. [2023-08-26 18:14:44,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:44,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 514 events. 249/514 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2532 event pairs, 30 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 950. Up to 352 conditions per place. [2023-08-26 18:14:44,428 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 25 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2023-08-26 18:14:44,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 134 flow [2023-08-26 18:14:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:14:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:14:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-26 18:14:44,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49114331723027377 [2023-08-26 18:14:44,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-26 18:14:44,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-26 18:14:44,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:44,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-26 18:14:44,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,436 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 305 transitions. [2023-08-26 18:14:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 134 flow [2023-08-26 18:14:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:14:44,438 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-08-26 18:14:44,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-26 18:14:44,438 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-26 18:14:44,439 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-08-26 18:14:44,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:44,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:44,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:14:44,439 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 18:14:44,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 774363323, now seen corresponding path program 1 times [2023-08-26 18:14:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404403316] [2023-08-26 18:14:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404403316] [2023-08-26 18:14:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404403316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:14:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636343215] [2023-08-26 18:14:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:44,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 207 [2023-08-26 18:14:44,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:44,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 207 [2023-08-26 18:14:44,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:44,741 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-08-26 18:14:44,741 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-26 18:14:44,742 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 1974 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 18:14:44,744 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-26 18:14:44,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 41 transitions, 180 flow [2023-08-26 18:14:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2023-08-26 18:14:44,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43768115942028984 [2023-08-26 18:14:44,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 453 transitions. [2023-08-26 18:14:44,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 453 transitions. [2023-08-26 18:14:44,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:44,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 453 transitions. [2023-08-26 18:14:44,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,752 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 5 states and 453 transitions. [2023-08-26 18:14:44,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 41 transitions, 180 flow [2023-08-26 18:14:44,752 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 18:14:44,753 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-26 18:14:44,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, 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 18:14:44,754 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-26 18:14:44,754 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-26 18:14:44,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:44,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:44,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:14:44,755 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 18:14:44,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -622561707, now seen corresponding path program 1 times [2023-08-26 18:14:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064368610] [2023-08-26 18:14:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064368610] [2023-08-26 18:14:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064368610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757531041] [2023-08-26 18:14:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:44,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:44,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 207 [2023-08-26 18:14:44,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:44,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:44,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 207 [2023-08-26 18:14:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:45,065 INFO L124 PetriNetUnfolderBase]: 253/446 cut-off events. [2023-08-26 18:14:45,065 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-08-26 18:14:45,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 446 events. 253/446 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1629 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 18:14:45,068 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 23 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2023-08-26 18:14:45,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 185 flow [2023-08-26 18:14:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-08-26 18:14:45,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43381642512077295 [2023-08-26 18:14:45,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-08-26 18:14:45,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-08-26 18:14:45,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:45,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-08-26 18:14:45,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,074 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 5 states and 449 transitions. [2023-08-26 18:14:45,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 185 flow [2023-08-26 18:14:45,078 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 18:14:45,079 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 75 flow [2023-08-26 18:14:45,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, 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 18:14:45,081 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-26 18:14:45,081 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 75 flow [2023-08-26 18:14:45,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:45,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:45,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:14:45,082 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 18:14:45,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1169192581, now seen corresponding path program 1 times [2023-08-26 18:14:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616858345] [2023-08-26 18:14:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:45,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:45,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616858345] [2023-08-26 18:14:45,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616858345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:45,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:45,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:14:45,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721812050] [2023-08-26 18:14:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:45,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:45,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-26 18:14:45,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:45,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-26 18:14:45,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:45,334 INFO L124 PetriNetUnfolderBase]: 179/336 cut-off events. [2023-08-26 18:14:45,338 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-08-26 18:14:45,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 336 events. 179/336 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1261 event pairs, 97 based on Foata normal form. 20/356 useless extension candidates. Maximal degree in co-relation 835. Up to 206 conditions per place. [2023-08-26 18:14:45,340 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 24 selfloop transitions, 3 changer transitions 11/39 dead transitions. [2023-08-26 18:14:45,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 199 flow [2023-08-26 18:14:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2023-08-26 18:14:45,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579710144927536 [2023-08-26 18:14:45,342 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 474 transitions. [2023-08-26 18:14:45,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 474 transitions. [2023-08-26 18:14:45,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:45,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 474 transitions. [2023-08-26 18:14:45,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,347 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 75 flow. Second operand 5 states and 474 transitions. [2023-08-26 18:14:45,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 199 flow [2023-08-26 18:14:45,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 185 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:45,349 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-26 18:14:45,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, 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 18:14:45,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-26 18:14:45,352 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-26 18:14:45,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:45,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:45,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:14:45,353 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 18:14:45,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash -124333747, now seen corresponding path program 1 times [2023-08-26 18:14:45,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669953950] [2023-08-26 18:14:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669953950] [2023-08-26 18:14:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669953950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:14:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091583314] [2023-08-26 18:14:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:45,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:14:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:45,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:14:45,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:14:45,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 207 [2023-08-26 18:14:45,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:45,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 207 [2023-08-26 18:14:45,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:45,603 INFO L124 PetriNetUnfolderBase]: 48/121 cut-off events. [2023-08-26 18:14:45,603 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-26 18:14:45,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 121 events. 48/121 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 358 event pairs, 16 based on Foata normal form. 18/137 useless extension candidates. Maximal degree in co-relation 308. Up to 80 conditions per place. [2023-08-26 18:14:45,604 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-26 18:14:45,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 157 flow [2023-08-26 18:14:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:14:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:14:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-08-26 18:14:45,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46859903381642515 [2023-08-26 18:14:45,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-08-26 18:14:45,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-08-26 18:14:45,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:45,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-08-26 18:14:45,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,610 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 3 states and 291 transitions. [2023-08-26 18:14:45,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 157 flow [2023-08-26 18:14:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 145 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 18:14:45,613 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 85 flow [2023-08-26 18:14:45,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, 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=3, PETRI_FLOW=85, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-08-26 18:14:45,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-26 18:14:45,618 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 85 flow [2023-08-26 18:14:45,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:45,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:14:45,618 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 18:14:45,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1656867723, now seen corresponding path program 1 times [2023-08-26 18:14:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35243596] [2023-08-26 18:14:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35243596] [2023-08-26 18:14:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35243596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371001265] [2023-08-26 18:14:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:45,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 207 [2023-08-26 18:14:45,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:45,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 207 [2023-08-26 18:14:45,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:45,840 INFO L124 PetriNetUnfolderBase]: 22/67 cut-off events. [2023-08-26 18:14:45,840 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 18:14:45,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 67 events. 22/67 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 12 based on Foata normal form. 9/74 useless extension candidates. Maximal degree in co-relation 185. Up to 37 conditions per place. [2023-08-26 18:14:45,841 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 22 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-26 18:14:45,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 160 flow [2023-08-26 18:14:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:14:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:14:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2023-08-26 18:14:45,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577294685990338 [2023-08-26 18:14:45,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2023-08-26 18:14:45,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2023-08-26 18:14:45,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:45,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2023-08-26 18:14:45,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,847 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 85 flow. Second operand 4 states and 379 transitions. [2023-08-26 18:14:45,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 160 flow [2023-08-26 18:14:45,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 144 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 18:14:45,849 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 86 flow [2023-08-26 18:14:45,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=4, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-26 18:14:45,850 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-26 18:14:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 86 flow [2023-08-26 18:14:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:45,851 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 18:14:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:14:45,852 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 18:14:45,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1123842145, now seen corresponding path program 1 times [2023-08-26 18:14:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094790000] [2023-08-26 18:14:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094790000] [2023-08-26 18:14:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094790000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:46,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:46,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:14:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640603728] [2023-08-26 18:14:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:14:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:14:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:14:46,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 207 [2023-08-26 18:14:46,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:46,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 207 [2023-08-26 18:14:46,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:46,445 INFO L124 PetriNetUnfolderBase]: 29/103 cut-off events. [2023-08-26 18:14:46,445 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-26 18:14:46,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 103 events. 29/103 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 335 event pairs, 3 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2023-08-26 18:14:46,446 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 28 selfloop transitions, 6 changer transitions 14/51 dead transitions. [2023-08-26 18:14:46,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 306 flow [2023-08-26 18:14:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 630 transitions. [2023-08-26 18:14:46,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-08-26 18:14:46,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 630 transitions. [2023-08-26 18:14:46,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 630 transitions. [2023-08-26 18:14:46,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:46,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 630 transitions. [2023-08-26 18:14:46,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,452 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,452 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 86 flow. Second operand 7 states and 630 transitions. [2023-08-26 18:14:46,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 306 flow [2023-08-26 18:14:46,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 278 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:46,455 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 119 flow [2023-08-26 18:14:46,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 18:14:46,456 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-26 18:14:46,457 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 119 flow [2023-08-26 18:14:46,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:46,457 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 18:14:46,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:14:46,457 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 18:14:46,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1207991511, now seen corresponding path program 2 times [2023-08-26 18:14:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967092447] [2023-08-26 18:14:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967092447] [2023-08-26 18:14:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967092447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:14:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271193390] [2023-08-26 18:14:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:46,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:46,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:46,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 207 [2023-08-26 18:14:46,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:46,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 207 [2023-08-26 18:14:46,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:46,739 INFO L124 PetriNetUnfolderBase]: 38/122 cut-off events. [2023-08-26 18:14:46,739 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-26 18:14:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 122 events. 38/122 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 423 event pairs, 12 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 393. Up to 48 conditions per place. [2023-08-26 18:14:46,740 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 18 selfloop transitions, 1 changer transitions 24/44 dead transitions. [2023-08-26 18:14:46,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 284 flow [2023-08-26 18:14:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2023-08-26 18:14:46,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4405797101449275 [2023-08-26 18:14:46,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 456 transitions. [2023-08-26 18:14:46,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 456 transitions. [2023-08-26 18:14:46,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:46,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 456 transitions. [2023-08-26 18:14:46,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,745 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 119 flow. Second operand 5 states and 456 transitions. [2023-08-26 18:14:46,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 284 flow [2023-08-26 18:14:46,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 278 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:46,747 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 89 flow [2023-08-26 18:14:46,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2023-08-26 18:14:46,747 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-26 18:14:46,748 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 20 transitions, 89 flow [2023-08-26 18:14:46,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:46,748 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 18:14:46,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:14:46,748 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 18:14:46,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 749166917, now seen corresponding path program 3 times [2023-08-26 18:14:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470103780] [2023-08-26 18:14:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:14:46,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:14:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:14:46,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:14:46,897 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:14:46,898 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 18:14:46,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 18:14:46,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 18:14:46,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 18:14:46,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 18:14:46,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 18:14:46,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 18:14:46,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 18:14:46,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 18:14:46,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:14:46,902 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:46,907 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:14:46,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:14:46,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:14:46 BasicIcfg [2023-08-26 18:14:46,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:14:46,972 INFO L158 Benchmark]: Toolchain (without parser) took 7913.60ms. Allocated memory was 369.1MB in the beginning and 518.0MB in the end (delta: 148.9MB). Free memory was 344.5MB in the beginning and 277.8MB in the end (delta: 66.7MB). Peak memory consumption was 217.7MB. Max. memory is 16.0GB. [2023-08-26 18:14:46,972 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 369.1MB. Free memory was 346.3MB in the beginning and 346.3MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:14:46,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.27ms. Allocated memory is still 369.1MB. Free memory was 344.1MB in the beginning and 321.4MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 18:14:46,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.24ms. Allocated memory is still 369.1MB. Free memory was 321.4MB in the beginning and 319.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 18:14:46,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.40ms. Allocated memory is still 369.1MB. Free memory was 319.0MB in the beginning and 317.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:14:46,973 INFO L158 Benchmark]: RCFGBuilder took 629.10ms. Allocated memory is still 369.1MB. Free memory was 317.2MB in the beginning and 337.7MB in the end (delta: -20.5MB). Peak memory consumption was 33.2MB. Max. memory is 16.0GB. [2023-08-26 18:14:46,973 INFO L158 Benchmark]: TraceAbstraction took 6746.96ms. Allocated memory was 369.1MB in the beginning and 518.0MB in the end (delta: 148.9MB). Free memory was 336.9MB in the beginning and 277.8MB in the end (delta: 59.0MB). Peak memory consumption was 207.5MB. Max. memory is 16.0GB. [2023-08-26 18:14:46,974 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.11ms. Allocated memory is still 369.1MB. Free memory was 346.3MB in the beginning and 346.3MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 426.27ms. Allocated memory is still 369.1MB. Free memory was 344.1MB in the beginning and 321.4MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.24ms. Allocated memory is still 369.1MB. Free memory was 321.4MB in the beginning and 319.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.40ms. Allocated memory is still 369.1MB. Free memory was 319.0MB in the beginning and 317.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 629.10ms. Allocated memory is still 369.1MB. Free memory was 317.2MB in the beginning and 337.7MB in the end (delta: -20.5MB). Peak memory consumption was 33.2MB. Max. memory is 16.0GB. * TraceAbstraction took 6746.96ms. Allocated memory was 369.1MB in the beginning and 518.0MB in the end (delta: 148.9MB). Free memory was 336.9MB in the beginning and 277.8MB in the end (delta: 59.0MB). Peak memory consumption was 207.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 106 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 26 TransitionsAfterwards, 1538 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 4331 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1898, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 886, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1898, independent: 870, independent conditional: 0, independent unconditional: 870, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 886, unknown conditional: 0, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-2, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=-1, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: 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, 125 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: 6.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 10 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:14:46,990 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...