/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:14:43,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:14:44,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:14:44,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:14:44,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:14:44,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:14:44,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:14:44,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:14:44,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:14:44,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:14:44,082 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:14:44,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:14:44,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:14:44,083 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:14:44,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:14:44,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:14:44,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:14:44,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:14:44,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:14:44,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:14:44,085 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:14:44,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:14:44,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:14:44,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:14:44,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:14:44,087 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:14:44,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:14:44,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:44,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:14:44,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:14:44,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:14:44,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:14:44,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:14:44,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:14:44,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:14:44,090 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:14:44,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:14:44,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:14:44,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:14:44,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:14:44,430 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:14:44,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-26 15:14:45,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:14:45,793 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:14:45,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-26 15:14:45,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d33b112a/e72a3c7b9ee047129fbbd557ebbbfdbc/FLAG1d84f0e6d [2023-08-26 15:14:45,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d33b112a/e72a3c7b9ee047129fbbd557ebbbfdbc [2023-08-26 15:14:45,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:14:45,836 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:14:45,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:45,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:14:45,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:14:45,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:45" (1/1) ... [2023-08-26 15:14:45,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30282f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:45, skipping insertion in model container [2023-08-26 15:14:45,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:45" (1/1) ... [2023-08-26 15:14:45,899 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:14:46,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:46,257 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:14:46,274 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:14:46,276 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:14:46,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:46,336 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:46,336 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:46,343 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:14:46,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46 WrapperNode [2023-08-26 15:14:46,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:46,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:46,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:14:46,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:14:46,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,402 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2023-08-26 15:14:46,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:46,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:14:46,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:14:46,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:14:46,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:14:46,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:14:46,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:14:46,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:14:46,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (1/1) ... [2023-08-26 15:14:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:14:46,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:14:46,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:14:46,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:14:46,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:14:46,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:14:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:14:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:14:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:14:46,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:14:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:14:46,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:14:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:14:46,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:14:46,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:14:46,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:14:46,507 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:14:46,618 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:14:46,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:14:46,937 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:14:47,121 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:14:47,122 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:14:47,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:47 BoogieIcfgContainer [2023-08-26 15:14:47,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:14:47,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:14:47,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:14:47,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:14:47,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:14:45" (1/3) ... [2023-08-26 15:14:47,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d35f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:47, skipping insertion in model container [2023-08-26 15:14:47,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:46" (2/3) ... [2023-08-26 15:14:47,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d35f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:47, skipping insertion in model container [2023-08-26 15:14:47,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:47" (3/3) ... [2023-08-26 15:14:47,132 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2023-08-26 15:14:47,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:14:47,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:14:47,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:14:47,197 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:14:47,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:14:47,292 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:14:47,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 15:14:47,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:14:47,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:47,304 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:14:47,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:47,319 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:47,338 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:14:47,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:47,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 15:14:47,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 1220 [2023-08-26 15:14:50,461 INFO L134 LiptonReduction]: Checked pairs total: 2952 [2023-08-26 15:14:50,461 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-26 15:14:50,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:14:50,478 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;@73f058fd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:14:50,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:14:50,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:14:50,480 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:14:50,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:50,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:50,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:14:50,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:50,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 462, now seen corresponding path program 1 times [2023-08-26 15:14:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039446299] [2023-08-26 15:14:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039446299] [2023-08-26 15:14:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039446299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:50,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:14:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107013647] [2023-08-26 15:14:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:50,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:14:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:50,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:14:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:14:50,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 202 [2023-08-26 15:14:50,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:50,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:50,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 202 [2023-08-26 15:14:50,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:50,781 INFO L124 PetriNetUnfolderBase]: 249/438 cut-off events. [2023-08-26 15:14:50,781 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 15:14:50,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 438 events. 249/438 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1710 event pairs, 249 based on Foata normal form. 24/382 useless extension candidates. Maximal degree in co-relation 868. Up to 427 conditions per place. [2023-08-26 15:14:50,786 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 15:14:50,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2023-08-26 15:14:50,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:14:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:14:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 199 transitions. [2023-08-26 15:14:50,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49257425742574257 [2023-08-26 15:14:50,801 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 199 transitions. [2023-08-26 15:14:50,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 199 transitions. [2023-08-26 15:14:50,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:50,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 199 transitions. [2023-08-26 15:14:50,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:50,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:50,815 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:50,817 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 199 transitions. [2023-08-26 15:14:50,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2023-08-26 15:14:50,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:50,821 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 15:14:50,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 15:14:50,826 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 15:14:50,826 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 15:14:50,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:50,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:50,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:14:50,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:14:50,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:50,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 437826754, now seen corresponding path program 1 times [2023-08-26 15:14:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872704718] [2023-08-26 15:14:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872704718] [2023-08-26 15:14:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872704718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:14:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052024895] [2023-08-26 15:14:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:51,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:14:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:14:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:14:51,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-26 15:14:51,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:51,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-26 15:14:51,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:51,213 INFO L124 PetriNetUnfolderBase]: 204/381 cut-off events. [2023-08-26 15:14:51,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:51,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 381 events. 204/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1566 event pairs, 24 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 744. Up to 293 conditions per place. [2023-08-26 15:14:51,219 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2023-08-26 15:14:51,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 110 flow [2023-08-26 15:14:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:14:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:14:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-26 15:14:51,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752475247524752 [2023-08-26 15:14:51,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-26 15:14:51,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-26 15:14:51,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:51,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-26 15:14:51,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,232 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 288 transitions. [2023-08-26 15:14:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 110 flow [2023-08-26 15:14:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:14:51,233 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2023-08-26 15:14:51,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2023-08-26 15:14:51,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 15:14:51,236 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 40 flow [2023-08-26 15:14:51,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:51,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:51,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:14:51,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:51,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -516903113, now seen corresponding path program 1 times [2023-08-26 15:14:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039161014] [2023-08-26 15:14:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039161014] [2023-08-26 15:14:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039161014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599810553] [2023-08-26 15:14:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:51,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:51,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 15:14:51,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:51,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 15:14:51,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:51,505 INFO L124 PetriNetUnfolderBase]: 175/320 cut-off events. [2023-08-26 15:14:51,505 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 15:14:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 320 events. 175/320 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1151 event pairs, 67 based on Foata normal form. 24/344 useless extension candidates. Maximal degree in co-relation 671. Up to 251 conditions per place. [2023-08-26 15:14:51,507 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 21 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-08-26 15:14:51,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 164 flow [2023-08-26 15:14:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:14:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:14:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2023-08-26 15:14:51,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43465346534653465 [2023-08-26 15:14:51,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 439 transitions. [2023-08-26 15:14:51,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 439 transitions. [2023-08-26 15:14:51,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:51,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 439 transitions. [2023-08-26 15:14:51,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,514 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 40 flow. Second operand 5 states and 439 transitions. [2023-08-26 15:14:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 164 flow [2023-08-26 15:14:51,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:51,515 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-08-26 15:14:51,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-26 15:14:51,516 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:14:51,516 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-08-26 15:14:51,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:51,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:51,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:14:51,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:51,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1896694914, now seen corresponding path program 1 times [2023-08-26 15:14:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128379865] [2023-08-26 15:14:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128379865] [2023-08-26 15:14:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128379865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92197265] [2023-08-26 15:14:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:51,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:14:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:14:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:14:51,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 15:14:51,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:51,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 15:14:51,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:51,899 INFO L124 PetriNetUnfolderBase]: 153/278 cut-off events. [2023-08-26 15:14:51,900 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-08-26 15:14:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 278 events. 153/278 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 914 event pairs, 53 based on Foata normal form. 12/290 useless extension candidates. Maximal degree in co-relation 703. Up to 197 conditions per place. [2023-08-26 15:14:51,901 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 19 selfloop transitions, 3 changer transitions 8/30 dead transitions. [2023-08-26 15:14:51,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 153 flow [2023-08-26 15:14:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:14:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:14:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-08-26 15:14:51,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267326732673267 [2023-08-26 15:14:51,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-08-26 15:14:51,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-08-26 15:14:51,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:51,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-08-26 15:14:51,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,908 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 5 states and 431 transitions. [2023-08-26 15:14:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 153 flow [2023-08-26 15:14:51,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 144 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:51,910 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 71 flow [2023-08-26 15:14:51,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-08-26 15:14:51,911 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-26 15:14:51,911 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 71 flow [2023-08-26 15:14:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:51,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:51,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:51,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:14:51,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:51,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -32204354, now seen corresponding path program 1 times [2023-08-26 15:14:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812802811] [2023-08-26 15:14:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812802811] [2023-08-26 15:14:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812802811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55619847] [2023-08-26 15:14:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:52,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:14:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:14:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:14:52,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-26 15:14:52,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:52,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-26 15:14:52,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:52,123 INFO L124 PetriNetUnfolderBase]: 42/102 cut-off events. [2023-08-26 15:14:52,123 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-26 15:14:52,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 102 events. 42/102 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 271 event pairs, 12 based on Foata normal form. 12/114 useless extension candidates. Maximal degree in co-relation 279. Up to 71 conditions per place. [2023-08-26 15:14:52,124 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 23 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-08-26 15:14:52,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 152 flow [2023-08-26 15:14:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:14:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:14:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-26 15:14:52,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570957095709571 [2023-08-26 15:14:52,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-26 15:14:52,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-26 15:14:52,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:52,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-26 15:14:52,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,133 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 71 flow. Second operand 3 states and 277 transitions. [2023-08-26 15:14:52,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 152 flow [2023-08-26 15:14:52,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 140 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:14:52,136 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 80 flow [2023-08-26 15:14:52,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=3, PETRI_FLOW=80, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-26 15:14:52,139 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:14:52,140 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 80 flow [2023-08-26 15:14:52,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:52,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:52,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:14:52,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:52,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -84276539, now seen corresponding path program 1 times [2023-08-26 15:14:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969261415] [2023-08-26 15:14:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969261415] [2023-08-26 15:14:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969261415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385633442] [2023-08-26 15:14:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:52,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:52,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-26 15:14:52,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:52,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-26 15:14:52,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:52,349 INFO L124 PetriNetUnfolderBase]: 18/54 cut-off events. [2023-08-26 15:14:52,349 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-26 15:14:52,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 54 events. 18/54 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 8 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 159. Up to 29 conditions per place. [2023-08-26 15:14:52,350 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-26 15:14:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 155 flow [2023-08-26 15:14:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 361 transitions. [2023-08-26 15:14:52,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467821782178218 [2023-08-26 15:14:52,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 361 transitions. [2023-08-26 15:14:52,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 361 transitions. [2023-08-26 15:14:52,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:52,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 361 transitions. [2023-08-26 15:14:52,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,354 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 80 flow. Second operand 4 states and 361 transitions. [2023-08-26 15:14:52,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 155 flow [2023-08-26 15:14:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 138 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 15:14:52,356 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2023-08-26 15:14:52,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-26 15:14:52,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-26 15:14:52,357 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2023-08-26 15:14:52,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:52,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:52,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:14:52,357 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:52,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1908085608, now seen corresponding path program 1 times [2023-08-26 15:14:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28013673] [2023-08-26 15:14:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28013673] [2023-08-26 15:14:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28013673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:14:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359513927] [2023-08-26 15:14:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:14:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:14:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:14:52,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-26 15:14:52,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:52,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-26 15:14:52,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:52,623 INFO L124 PetriNetUnfolderBase]: 24/73 cut-off events. [2023-08-26 15:14:52,623 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-08-26 15:14:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 73 events. 24/73 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 182 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 218. Up to 42 conditions per place. [2023-08-26 15:14:52,624 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 22 selfloop transitions, 7 changer transitions 11/40 dead transitions. [2023-08-26 15:14:52,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 239 flow [2023-08-26 15:14:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:14:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:14:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2023-08-26 15:14:52,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158415841584158 [2023-08-26 15:14:52,626 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 504 transitions. [2023-08-26 15:14:52,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 504 transitions. [2023-08-26 15:14:52,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:52,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 504 transitions. [2023-08-26 15:14:52,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,630 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,630 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 6 states and 504 transitions. [2023-08-26 15:14:52,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 239 flow [2023-08-26 15:14:52,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 220 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:52,633 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 106 flow [2023-08-26 15:14:52,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=72, 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-26 15:14:52,634 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-08-26 15:14:52,635 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 106 flow [2023-08-26 15:14:52,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:52,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:52,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:14:52,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:52,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 408377626, now seen corresponding path program 2 times [2023-08-26 15:14:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153730255] [2023-08-26 15:14:52,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153730255] [2023-08-26 15:14:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153730255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:14:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756875313] [2023-08-26 15:14:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:52,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:14:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:14:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:14:52,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-26 15:14:52,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:52,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-26 15:14:52,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:52,936 INFO L124 PetriNetUnfolderBase]: 17/66 cut-off events. [2023-08-26 15:14:52,937 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-08-26 15:14:52,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 66 events. 17/66 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 166 event pairs, 3 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 219. Up to 26 conditions per place. [2023-08-26 15:14:52,937 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 17 selfloop transitions, 3 changer transitions 15/35 dead transitions. [2023-08-26 15:14:52,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 226 flow [2023-08-26 15:14:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:14:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:14:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 578 transitions. [2023-08-26 15:14:52,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087694483734088 [2023-08-26 15:14:52,940 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 578 transitions. [2023-08-26 15:14:52,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 578 transitions. [2023-08-26 15:14:52,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:52,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 578 transitions. [2023-08-26 15:14:52,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,944 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 106 flow. Second operand 7 states and 578 transitions. [2023-08-26 15:14:52,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 226 flow [2023-08-26 15:14:52,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 221 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:52,947 INFO L231 Difference]: Finished difference. Result has 41 places, 18 transitions, 85 flow [2023-08-26 15:14:52,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=18} [2023-08-26 15:14:52,949 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2023-08-26 15:14:52,949 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 18 transitions, 85 flow [2023-08-26 15:14:52,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:52,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:52,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:52,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:14:52,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:52,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -698092576, now seen corresponding path program 3 times [2023-08-26 15:14:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783939138] [2023-08-26 15:14:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783939138] [2023-08-26 15:14:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783939138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:53,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:53,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:14:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228318188] [2023-08-26 15:14:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:53,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:14:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:53,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:14:53,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:14:53,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-26 15:14:53,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 18 transitions, 85 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:53,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:53,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-26 15:14:53,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:53,431 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-08-26 15:14:53,431 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 15:14:53,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 38 events. 6/38 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 131. Up to 13 conditions per place. [2023-08-26 15:14:53,432 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 14 selfloop transitions, 4 changer transitions 9/28 dead transitions. [2023-08-26 15:14:53,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 192 flow [2023-08-26 15:14:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:14:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:14:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 648 transitions. [2023-08-26 15:14:53,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.400990099009901 [2023-08-26 15:14:53,434 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 648 transitions. [2023-08-26 15:14:53,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 648 transitions. [2023-08-26 15:14:53,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:53,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 648 transitions. [2023-08-26 15:14:53,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:53,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:53,438 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:53,438 INFO L175 Difference]: Start difference. First operand has 41 places, 18 transitions, 85 flow. Second operand 8 states and 648 transitions. [2023-08-26 15:14:53,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 192 flow [2023-08-26 15:14:53,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 164 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-26 15:14:53,440 INFO L231 Difference]: Finished difference. Result has 40 places, 18 transitions, 82 flow [2023-08-26 15:14:53,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2023-08-26 15:14:53,440 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-26 15:14:53,440 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 18 transitions, 82 flow [2023-08-26 15:14:53,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:53,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:53,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:53,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:14:53,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:53,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1689612086, now seen corresponding path program 4 times [2023-08-26 15:14:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700366861] [2023-08-26 15:14:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:53,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:14:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:53,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:14:53,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:14:53,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:14:53,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:14:53,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:14:53,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:14:53,516 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:53,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:14:53,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:14:53,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:14:53 BasicIcfg [2023-08-26 15:14:53,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:14:53,559 INFO L158 Benchmark]: Toolchain (without parser) took 7723.75ms. Allocated memory was 364.9MB in the beginning and 484.4MB in the end (delta: 119.5MB). Free memory was 339.5MB in the beginning and 342.8MB in the end (delta: -3.4MB). Peak memory consumption was 117.0MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,560 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 364.9MB. Free memory was 340.8MB in the beginning and 340.6MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:14:53,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.98ms. Allocated memory is still 364.9MB. Free memory was 338.9MB in the beginning and 316.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 364.9MB. Free memory was 316.7MB in the beginning and 314.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,560 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 364.9MB. Free memory was 314.6MB in the beginning and 312.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,560 INFO L158 Benchmark]: RCFGBuilder took 694.15ms. Allocated memory is still 364.9MB. Free memory was 312.5MB in the beginning and 338.2MB in the end (delta: -25.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,561 INFO L158 Benchmark]: TraceAbstraction took 6432.90ms. Allocated memory was 364.9MB in the beginning and 484.4MB in the end (delta: 119.5MB). Free memory was 338.2MB in the beginning and 342.8MB in the end (delta: -4.6MB). Peak memory consumption was 115.0MB. Max. memory is 16.0GB. [2023-08-26 15:14:53,562 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 364.9MB. Free memory was 340.8MB in the beginning and 340.6MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 504.98ms. Allocated memory is still 364.9MB. Free memory was 338.9MB in the beginning and 316.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 364.9MB. Free memory was 316.7MB in the beginning and 314.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 364.9MB. Free memory was 314.6MB in the beginning and 312.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 694.15ms. Allocated memory is still 364.9MB. Free memory was 312.5MB in the beginning and 338.2MB in the end (delta: -25.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 6432.90ms. Allocated memory was 364.9MB in the beginning and 484.4MB in the end (delta: 119.5MB). Free memory was 338.2MB in the beginning and 342.8MB in the end (delta: -4.6MB). Peak memory consumption was 115.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 101 PlacesBefore, 30 PlacesAfterwards, 97 TransitionsBefore, 24 TransitionsAfterwards, 1220 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 2952 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1693, independent: 1571, independent conditional: 0, independent unconditional: 1571, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 688, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1693, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 688, unknown conditional: 0, unknown unconditional: 688] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, 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: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-2, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=-1, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi004.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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, 117 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.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 6 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 491 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 15:14:53,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...