/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:50:06,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:50:06,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:50:06,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:50:06,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:50:06,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:50:06,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:50:06,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:50:06,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:50:06,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:50:06,881 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:50:06,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:50:06,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:50:06,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:50:06,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:50:06,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:50:06,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:50:06,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:50:06,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:50:06,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:50:06,884 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:50:06,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:50:06,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:50:06,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:50:06,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:50:06,886 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:50:06,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:50:06,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:50:06,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:50:06,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:50:06,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:50:06,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:50:06,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:50:06,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:50:06,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:50:06,889 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:50:07,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:50:07,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:50:07,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:50:07,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:50:07,229 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:50:07,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-26 12:50:08,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:50:08,764 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:50:08,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-26 12:50:08,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ebc823a/adec3225661d4e3c9553189d5cb478f6/FLAG4192ac034 [2023-08-26 12:50:08,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ebc823a/adec3225661d4e3c9553189d5cb478f6 [2023-08-26 12:50:08,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:50:08,799 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:50:08,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:50:08,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:50:08,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:50:08,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:50:08" (1/1) ... [2023-08-26 12:50:08,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a1ed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:08, skipping insertion in model container [2023-08-26 12:50:08,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:50:08" (1/1) ... [2023-08-26 12:50:08,842 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:50:09,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:50:09,104 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:50:09,122 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-26 12:50:09,123 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-08-26 12:50:09,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:50:09,174 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:50:09,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09 WrapperNode [2023-08-26 12:50:09,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:50:09,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:50:09,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:50:09,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:50:09,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,214 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 147 [2023-08-26 12:50:09,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:50:09,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:50:09,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:50:09,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:50:09,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:50:09,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:50:09,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:50:09,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:50:09,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (1/1) ... [2023-08-26 12:50:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:50:09,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:50:09,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:50:09,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:50:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-26 12:50:09,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-26 12:50:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:50:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 12:50:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:50:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:50:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-08-26 12:50:09,310 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-08-26 12:50:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 12:50:09,310 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 12:50:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:50:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:50:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:50:09,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:50:09,312 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:50:09,419 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:50:09,420 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:50:09,767 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:50:09,780 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:50:09,781 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:50:09,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:50:09 BoogieIcfgContainer [2023-08-26 12:50:09,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:50:09,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:50:09,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:50:09,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:50:09,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:50:08" (1/3) ... [2023-08-26 12:50:09,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e7166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:50:09, skipping insertion in model container [2023-08-26 12:50:09,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:09" (2/3) ... [2023-08-26 12:50:09,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e7166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:50:09, skipping insertion in model container [2023-08-26 12:50:09,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:50:09" (3/3) ... [2023-08-26 12:50:09,792 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-08-26 12:50:09,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:50:09,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:50:09,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:50:09,897 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:50:09,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 184 transitions, 383 flow [2023-08-26 12:50:09,994 INFO L124 PetriNetUnfolderBase]: 9/181 cut-off events. [2023-08-26 12:50:09,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:50:10,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 9/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 351 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-26 12:50:10,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 184 transitions, 383 flow [2023-08-26 12:50:10,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 371 flow [2023-08-26 12:50:10,010 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:50:10,018 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 181 transitions, 371 flow [2023-08-26 12:50:10,020 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 181 transitions, 371 flow [2023-08-26 12:50:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 181 transitions, 371 flow [2023-08-26 12:50:10,055 INFO L124 PetriNetUnfolderBase]: 9/181 cut-off events. [2023-08-26 12:50:10,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:50:10,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 9/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 351 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-26 12:50:10,062 INFO L119 LiptonReduction]: Number of co-enabled transitions 12214 [2023-08-26 12:50:15,469 INFO L134 LiptonReduction]: Checked pairs total: 27334 [2023-08-26 12:50:15,469 INFO L136 LiptonReduction]: Total number of compositions: 200 [2023-08-26 12:50:15,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:50:15,497 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;@40362594, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:50:15,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:50:15,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:50:15,499 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:50:15,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:50:15,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:15,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:50:15,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:15,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 720, now seen corresponding path program 1 times [2023-08-26 12:50:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995676465] [2023-08-26 12:50:15,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:15,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:15,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995676465] [2023-08-26 12:50:15,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995676465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:15,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:15,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:50:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117018573] [2023-08-26 12:50:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:15,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:50:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:15,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:50:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:50:15,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 384 [2023-08-26 12:50:15,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:15,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:15,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 384 [2023-08-26 12:50:15,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:16,088 INFO L124 PetriNetUnfolderBase]: 2101/3542 cut-off events. [2023-08-26 12:50:16,089 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 12:50:16,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6601 conditions, 3542 events. 2101/3542 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23392 event pairs, 1921 based on Foata normal form. 100/2663 useless extension candidates. Maximal degree in co-relation 6590. Up to 3003 conditions per place. [2023-08-26 12:50:16,117 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 29 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-26 12:50:16,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 151 flow [2023-08-26 12:50:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:50:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:50:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2023-08-26 12:50:16,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817708333333333 [2023-08-26 12:50:16,130 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 370 transitions. [2023-08-26 12:50:16,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 370 transitions. [2023-08-26 12:50:16,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:16,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 370 transitions. [2023-08-26 12:50:16,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,143 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,144 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 2 states and 370 transitions. [2023-08-26 12:50:16,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 151 flow [2023-08-26 12:50:16,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:50:16,150 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 90 flow [2023-08-26 12:50:16,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 12:50:16,156 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-26 12:50:16,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 90 flow [2023-08-26 12:50:16,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:16,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:50:16,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:50:16,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:16,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 705675, now seen corresponding path program 1 times [2023-08-26 12:50:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776194147] [2023-08-26 12:50:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776194147] [2023-08-26 12:50:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776194147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289642464] [2023-08-26 12:50:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:16,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 384 [2023-08-26 12:50:16,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:16,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 384 [2023-08-26 12:50:16,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:16,741 INFO L124 PetriNetUnfolderBase]: 2096/3527 cut-off events. [2023-08-26 12:50:16,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:50:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3527 events. 2096/3527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23299 event pairs, 1682 based on Foata normal form. 0/2554 useless extension candidates. Maximal degree in co-relation 6571. Up to 2637 conditions per place. [2023-08-26 12:50:16,766 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 38 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-26 12:50:16,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 192 flow [2023-08-26 12:50:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-26 12:50:16,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2023-08-26 12:50:16,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-26 12:50:16,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-26 12:50:16,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:16,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-26 12:50:16,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,780 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 90 flow. Second operand 3 states and 488 transitions. [2023-08-26 12:50:16,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 192 flow [2023-08-26 12:50:16,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:50:16,781 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-08-26 12:50:16,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-26 12:50:16,783 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-26 12:50:16,784 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-08-26 12:50:16,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:16,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:50:16,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:50:16,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:16,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 705674, now seen corresponding path program 1 times [2023-08-26 12:50:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762012033] [2023-08-26 12:50:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762012033] [2023-08-26 12:50:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762012033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866266782] [2023-08-26 12:50:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:16,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 12:50:16,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:16,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:16,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 12:50:16,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:17,300 INFO L124 PetriNetUnfolderBase]: 2091/3512 cut-off events. [2023-08-26 12:50:17,301 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 12:50:17,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 3512 events. 2091/3512 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23192 event pairs, 1678 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 6647. Up to 2627 conditions per place. [2023-08-26 12:50:17,324 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 37 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-26 12:50:17,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 192 flow [2023-08-26 12:50:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-26 12:50:17,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2023-08-26 12:50:17,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-26 12:50:17,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-26 12:50:17,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:17,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-26 12:50:17,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,330 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 496 transitions. [2023-08-26 12:50:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 192 flow [2023-08-26 12:50:17,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:50:17,337 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-08-26 12:50:17,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-26 12:50:17,339 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-26 12:50:17,341 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-08-26 12:50:17,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:17,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:50:17,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:50:17,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:17,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 678170430, now seen corresponding path program 1 times [2023-08-26 12:50:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:17,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634894677] [2023-08-26 12:50:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634894677] [2023-08-26 12:50:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634894677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164500121] [2023-08-26 12:50:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:17,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 384 [2023-08-26 12:50:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 384 [2023-08-26 12:50:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:17,712 INFO L124 PetriNetUnfolderBase]: 2056/3447 cut-off events. [2023-08-26 12:50:17,712 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 12:50:17,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 3447 events. 2056/3447 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22860 event pairs, 1647 based on Foata normal form. 0/2612 useless extension candidates. Maximal degree in co-relation 6527. Up to 2572 conditions per place. [2023-08-26 12:50:17,732 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 36 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-26 12:50:17,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 188 flow [2023-08-26 12:50:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-26 12:50:17,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2023-08-26 12:50:17,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-26 12:50:17,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-26 12:50:17,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:17,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-26 12:50:17,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,739 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 486 transitions. [2023-08-26 12:50:17,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 188 flow [2023-08-26 12:50:17,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:50:17,744 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-08-26 12:50:17,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-26 12:50:17,745 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-26 12:50:17,745 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-08-26 12:50:17,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:17,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:50:17,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:50:17,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:17,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 678170431, now seen corresponding path program 1 times [2023-08-26 12:50:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977421968] [2023-08-26 12:50:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:17,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977421968] [2023-08-26 12:50:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977421968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:17,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954239696] [2023-08-26 12:50:17,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:17,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:17,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:17,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 12:50:17,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:17,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:17,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 12:50:17,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:18,069 INFO L124 PetriNetUnfolderBase]: 2021/3382 cut-off events. [2023-08-26 12:50:18,071 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 12:50:18,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 3382 events. 2021/3382 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22351 event pairs, 1616 based on Foata normal form. 0/2579 useless extension candidates. Maximal degree in co-relation 6407. Up to 2517 conditions per place. [2023-08-26 12:50:18,093 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 35 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-26 12:50:18,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 184 flow [2023-08-26 12:50:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-26 12:50:18,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288194444444444 [2023-08-26 12:50:18,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-26 12:50:18,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-26 12:50:18,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:18,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-26 12:50:18,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:18,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:18,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:18,100 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 3 states and 494 transitions. [2023-08-26 12:50:18,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 184 flow [2023-08-26 12:50:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:50:18,105 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2023-08-26 12:50:18,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 12:50:18,106 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-26 12:50:18,106 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 86 flow [2023-08-26 12:50:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:18,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:18,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:18,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:50:18,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:18,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash -149603959, now seen corresponding path program 1 times [2023-08-26 12:50:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:18,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473996963] [2023-08-26 12:50:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:18,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473996963] [2023-08-26 12:50:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473996963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134132850] [2023-08-26 12:50:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:18,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:50:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:18,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:50:18,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:50:18,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 384 [2023-08-26 12:50:18,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:18,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:18,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 384 [2023-08-26 12:50:18,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:19,234 INFO L124 PetriNetUnfolderBase]: 10022/14741 cut-off events. [2023-08-26 12:50:19,234 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2023-08-26 12:50:19,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29424 conditions, 14741 events. 10022/14741 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 92463 event pairs, 2015 based on Foata normal form. 0/12555 useless extension candidates. Maximal degree in co-relation 29420. Up to 6242 conditions per place. [2023-08-26 12:50:19,402 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 149 selfloop transitions, 10 changer transitions 0/163 dead transitions. [2023-08-26 12:50:19,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 163 transitions, 680 flow [2023-08-26 12:50:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:50:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:50:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1402 transitions. [2023-08-26 12:50:19,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563802083333333 [2023-08-26 12:50:19,406 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1402 transitions. [2023-08-26 12:50:19,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1402 transitions. [2023-08-26 12:50:19,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:19,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1402 transitions. [2023-08-26 12:50:19,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.25) internal successors, (1402), 8 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:19,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:19,415 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:19,415 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 86 flow. Second operand 8 states and 1402 transitions. [2023-08-26 12:50:19,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 163 transitions, 680 flow [2023-08-26 12:50:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 163 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:50:19,423 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 151 flow [2023-08-26 12:50:19,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-26 12:50:19,424 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-26 12:50:19,424 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 151 flow [2023-08-26 12:50:19,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:19,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:19,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:19,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:50:19,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:19,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1472282220, now seen corresponding path program 1 times [2023-08-26 12:50:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281955318] [2023-08-26 12:50:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281955318] [2023-08-26 12:50:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281955318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051785402] [2023-08-26 12:50:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:50:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:50:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:50:19,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 384 [2023-08-26 12:50:19,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:19,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:19,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 384 [2023-08-26 12:50:19,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:20,755 INFO L124 PetriNetUnfolderBase]: 11122/16535 cut-off events. [2023-08-26 12:50:20,755 INFO L125 PetriNetUnfolderBase]: For 8683/8683 co-relation queries the response was YES. [2023-08-26 12:50:20,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39663 conditions, 16535 events. 11122/16535 cut-off events. For 8683/8683 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 104886 event pairs, 3267 based on Foata normal form. 0/14846 useless extension candidates. Maximal degree in co-relation 39654. Up to 8273 conditions per place. [2023-08-26 12:50:20,949 INFO L140 encePairwiseOnDemand]: 375/384 looper letters, 130 selfloop transitions, 20 changer transitions 0/154 dead transitions. [2023-08-26 12:50:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 154 transitions, 807 flow [2023-08-26 12:50:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:50:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:50:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1361 transitions. [2023-08-26 12:50:20,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4430338541666667 [2023-08-26 12:50:20,954 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1361 transitions. [2023-08-26 12:50:20,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1361 transitions. [2023-08-26 12:50:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:20,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1361 transitions. [2023-08-26 12:50:20,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.125) internal successors, (1361), 8 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:20,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:20,964 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:20,964 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 151 flow. Second operand 8 states and 1361 transitions. [2023-08-26 12:50:20,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 154 transitions, 807 flow [2023-08-26 12:50:21,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:50:21,041 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 340 flow [2023-08-26 12:50:21,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=340, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-26 12:50:21,042 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2023-08-26 12:50:21,042 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 340 flow [2023-08-26 12:50:21,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:21,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:21,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:50:21,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:21,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 828218967, now seen corresponding path program 1 times [2023-08-26 12:50:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:21,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365946383] [2023-08-26 12:50:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365946383] [2023-08-26 12:50:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365946383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:21,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193942096] [2023-08-26 12:50:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:21,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:21,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:21,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 384 [2023-08-26 12:50:21,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:21,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 384 [2023-08-26 12:50:21,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:21,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L707-->t2_funErr0ASSERT_VIOLATIONASSERT: Formula: (and (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| 0) (= (store |v_#pthreadsMutex_128| |v_~#A~0.base_49| (store (select |v_#pthreadsMutex_128| |v_~#A~0.base_49|) |v_~#A~0.offset_49| 0)) |v_#pthreadsMutex_127|) (= (ite (<= |v_t2_funThread1of1ForFork2_~y~0#1_19| |v_t2_funThread1of1ForFork2_~x~1#1_21|) 1 0) |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|) (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_128|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} OutVars{t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|, #pthreadsMutex=|v_#pthreadsMutex_127|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base_23|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset_23|, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} AuxVars[] AssignedVars[t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1][62], [Black: 209#(<= ~h~0 ~g~0), 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, 81#L693true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 179#t2_funErr0ASSERT_VIOLATIONASSERTtrue, t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 207#true, Black: 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,556 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L707-->t2_funErr0ASSERT_VIOLATIONASSERT: Formula: (and (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| 0) (= (store |v_#pthreadsMutex_128| |v_~#A~0.base_49| (store (select |v_#pthreadsMutex_128| |v_~#A~0.base_49|) |v_~#A~0.offset_49| 0)) |v_#pthreadsMutex_127|) (= (ite (<= |v_t2_funThread1of1ForFork2_~y~0#1_19| |v_t2_funThread1of1ForFork2_~x~1#1_21|) 1 0) |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|) (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_128|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} OutVars{t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|, #pthreadsMutex=|v_#pthreadsMutex_127|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base_23|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset_23|, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} AuxVars[] AssignedVars[t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1][62], [Black: 209#(<= ~h~0 ~g~0), 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, 81#L693true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 179#t2_funErr0ASSERT_VIOLATIONASSERTtrue, t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, 180#t3_funEXITtrue, t_funThread1of1ForFork0InUse, 207#true, Black: 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,557 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,557 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,557 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,557 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 12:50:21,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 176#t2_funEXITtrue, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,619 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,619 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,619 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,619 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, 180#t3_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 176#t2_funEXITtrue, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,620 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,620 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,620 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,620 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,651 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 176#t2_funEXITtrue, Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,651 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,651 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,651 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,651 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,651 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,652 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, 180#t3_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 176#t2_funEXITtrue, Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 12:50:21,652 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,652 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,652 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,652 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,652 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 12:50:21,709 INFO L124 PetriNetUnfolderBase]: 4115/7781 cut-off events. [2023-08-26 12:50:21,709 INFO L125 PetriNetUnfolderBase]: For 8467/8818 co-relation queries the response was YES. [2023-08-26 12:50:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20822 conditions, 7781 events. 4115/7781 cut-off events. For 8467/8818 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 62122 event pairs, 1823 based on Foata normal form. 698/7702 useless extension candidates. Maximal degree in co-relation 20807. Up to 4618 conditions per place. [2023-08-26 12:50:21,826 INFO L140 encePairwiseOnDemand]: 369/384 looper letters, 39 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2023-08-26 12:50:21,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 520 flow [2023-08-26 12:50:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-26 12:50:21,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314236111111111 [2023-08-26 12:50:21,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-26 12:50:21,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-26 12:50:21,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:21,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-26 12:50:21,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,833 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 340 flow. Second operand 3 states and 497 transitions. [2023-08-26 12:50:21,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 520 flow [2023-08-26 12:50:21,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 516 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 12:50:21,908 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 422 flow [2023-08-26 12:50:21,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-26 12:50:21,909 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2023-08-26 12:50:21,909 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 422 flow [2023-08-26 12:50:21,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:21,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:21,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:21,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:50:21,910 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t3_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:21,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -174716296, now seen corresponding path program 1 times [2023-08-26 12:50:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829972292] [2023-08-26 12:50:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829972292] [2023-08-26 12:50:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829972292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535784270] [2023-08-26 12:50:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:22,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:50:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:50:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:50:22,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 384 [2023-08-26 12:50:22,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:22,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:22,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 384 [2023-08-26 12:50:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:23,124 INFO L124 PetriNetUnfolderBase]: 7384/12060 cut-off events. [2023-08-26 12:50:23,124 INFO L125 PetriNetUnfolderBase]: For 17391/17474 co-relation queries the response was YES. [2023-08-26 12:50:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41819 conditions, 12060 events. 7384/12060 cut-off events. For 17391/17474 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 80854 event pairs, 2773 based on Foata normal form. 83/11310 useless extension candidates. Maximal degree in co-relation 41802. Up to 5762 conditions per place. [2023-08-26 12:50:23,196 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 134 selfloop transitions, 31 changer transitions 4/177 dead transitions. [2023-08-26 12:50:23,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 177 transitions, 1373 flow [2023-08-26 12:50:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:50:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:50:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1357 transitions. [2023-08-26 12:50:23,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417317708333333 [2023-08-26 12:50:23,201 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1357 transitions. [2023-08-26 12:50:23,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1357 transitions. [2023-08-26 12:50:23,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:23,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1357 transitions. [2023-08-26 12:50:23,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.625) internal successors, (1357), 8 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:23,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:23,209 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:23,209 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 422 flow. Second operand 8 states and 1357 transitions. [2023-08-26 12:50:23,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 177 transitions, 1373 flow [2023-08-26 12:50:23,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 177 transitions, 1327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:50:23,342 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 711 flow [2023-08-26 12:50:23,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2023-08-26 12:50:23,343 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-26 12:50:23,343 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 711 flow [2023-08-26 12:50:23,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:23,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:23,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:50:23,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:23,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2096501696, now seen corresponding path program 1 times [2023-08-26 12:50:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348322983] [2023-08-26 12:50:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348322983] [2023-08-26 12:50:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348322983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:50:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232636380] [2023-08-26 12:50:23,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:50:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:50:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:50:23,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 12:50:23,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:23,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:23,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 12:50:23,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:24,770 INFO L124 PetriNetUnfolderBase]: 8293/13754 cut-off events. [2023-08-26 12:50:24,771 INFO L125 PetriNetUnfolderBase]: For 29621/29729 co-relation queries the response was YES. [2023-08-26 12:50:24,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48582 conditions, 13754 events. 8293/13754 cut-off events. For 29621/29729 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 97862 event pairs, 2264 based on Foata normal form. 446/13788 useless extension candidates. Maximal degree in co-relation 48560. Up to 6030 conditions per place. [2023-08-26 12:50:24,862 INFO L140 encePairwiseOnDemand]: 378/384 looper letters, 176 selfloop transitions, 35 changer transitions 0/219 dead transitions. [2023-08-26 12:50:24,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 219 transitions, 1811 flow [2023-08-26 12:50:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:50:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:50:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1202 transitions. [2023-08-26 12:50:24,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44717261904761907 [2023-08-26 12:50:24,867 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1202 transitions. [2023-08-26 12:50:24,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1202 transitions. [2023-08-26 12:50:24,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:24,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1202 transitions. [2023-08-26 12:50:24,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.71428571428572) internal successors, (1202), 7 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:24,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:24,880 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:24,880 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 711 flow. Second operand 7 states and 1202 transitions. [2023-08-26 12:50:24,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 219 transitions, 1811 flow [2023-08-26 12:50:25,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 219 transitions, 1805 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 12:50:25,034 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 822 flow [2023-08-26 12:50:25,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2023-08-26 12:50:25,035 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-26 12:50:25,035 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 822 flow [2023-08-26 12:50:25,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:25,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:25,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:50:25,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:25,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 61376169, now seen corresponding path program 1 times [2023-08-26 12:50:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:25,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691363533] [2023-08-26 12:50:25,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691363533] [2023-08-26 12:50:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691363533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019913345] [2023-08-26 12:50:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:25,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:50:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:50:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:50:25,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 384 [2023-08-26 12:50:25,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:25,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 384 [2023-08-26 12:50:25,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:25,708 INFO L124 PetriNetUnfolderBase]: 1354/3051 cut-off events. [2023-08-26 12:50:25,708 INFO L125 PetriNetUnfolderBase]: For 9880/10287 co-relation queries the response was YES. [2023-08-26 12:50:25,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11329 conditions, 3051 events. 1354/3051 cut-off events. For 9880/10287 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 23430 event pairs, 205 based on Foata normal form. 373/3243 useless extension candidates. Maximal degree in co-relation 11302. Up to 1643 conditions per place. [2023-08-26 12:50:25,718 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 44 selfloop transitions, 16 changer transitions 2/107 dead transitions. [2023-08-26 12:50:25,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 982 flow [2023-08-26 12:50:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:50:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:50:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2023-08-26 12:50:25,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3971354166666667 [2023-08-26 12:50:25,720 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2023-08-26 12:50:25,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2023-08-26 12:50:25,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:25,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2023-08-26 12:50:25,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,727 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 822 flow. Second operand 4 states and 610 transitions. [2023-08-26 12:50:25,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 982 flow [2023-08-26 12:50:25,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 917 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 12:50:25,760 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 719 flow [2023-08-26 12:50:25,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2023-08-26 12:50:25,761 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-26 12:50:25,761 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 719 flow [2023-08-26 12:50:25,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:25,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:25,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:50:25,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:25,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 916705620, now seen corresponding path program 1 times [2023-08-26 12:50:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280764451] [2023-08-26 12:50:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280764451] [2023-08-26 12:50:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280764451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:50:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102454466] [2023-08-26 12:50:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:50:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:50:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:50:25,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 12:50:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:25,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:25,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 12:50:25,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:26,510 INFO L124 PetriNetUnfolderBase]: 2238/4456 cut-off events. [2023-08-26 12:50:26,510 INFO L125 PetriNetUnfolderBase]: For 11602/11683 co-relation queries the response was YES. [2023-08-26 12:50:26,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17077 conditions, 4456 events. 2238/4456 cut-off events. For 11602/11683 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 32492 event pairs, 484 based on Foata normal form. 225/4583 useless extension candidates. Maximal degree in co-relation 17052. Up to 1537 conditions per place. [2023-08-26 12:50:26,542 INFO L140 encePairwiseOnDemand]: 376/384 looper letters, 190 selfloop transitions, 39 changer transitions 8/245 dead transitions. [2023-08-26 12:50:26,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 245 transitions, 2059 flow [2023-08-26 12:50:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:50:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:50:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2153 transitions. [2023-08-26 12:50:26,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312900641025641 [2023-08-26 12:50:26,548 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2153 transitions. [2023-08-26 12:50:26,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2153 transitions. [2023-08-26 12:50:26,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:26,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2153 transitions. [2023-08-26 12:50:26,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 165.6153846153846) internal successors, (2153), 13 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:26,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:26,560 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:26,560 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 719 flow. Second operand 13 states and 2153 transitions. [2023-08-26 12:50:26,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 245 transitions, 2059 flow [2023-08-26 12:50:26,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 245 transitions, 1990 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:50:26,619 INFO L231 Difference]: Finished difference. Result has 108 places, 92 transitions, 859 flow [2023-08-26 12:50:26,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=859, PETRI_PLACES=108, PETRI_TRANSITIONS=92} [2023-08-26 12:50:26,620 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2023-08-26 12:50:26,620 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 859 flow [2023-08-26 12:50:26,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:26,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:26,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:26,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:50:26,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:26,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 840095611, now seen corresponding path program 1 times [2023-08-26 12:50:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:26,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575903634] [2023-08-26 12:50:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:26,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:26,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575903634] [2023-08-26 12:50:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575903634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:26,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:26,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:50:26,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570547212] [2023-08-26 12:50:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:50:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:50:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:50:26,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 384 [2023-08-26 12:50:26,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:26,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:26,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 384 [2023-08-26 12:50:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:27,501 INFO L124 PetriNetUnfolderBase]: 2093/4315 cut-off events. [2023-08-26 12:50:27,501 INFO L125 PetriNetUnfolderBase]: For 14595/14653 co-relation queries the response was YES. [2023-08-26 12:50:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 4315 events. 2093/4315 cut-off events. For 14595/14653 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 31598 event pairs, 584 based on Foata normal form. 186/4458 useless extension candidates. Maximal degree in co-relation 17656. Up to 1568 conditions per place. [2023-08-26 12:50:27,531 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 177 selfloop transitions, 32 changer transitions 28/245 dead transitions. [2023-08-26 12:50:27,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 245 transitions, 2429 flow [2023-08-26 12:50:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:50:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:50:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2097 transitions. [2023-08-26 12:50:27,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42007211538461536 [2023-08-26 12:50:27,537 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2097 transitions. [2023-08-26 12:50:27,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2097 transitions. [2023-08-26 12:50:27,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:27,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2097 transitions. [2023-08-26 12:50:27,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 161.30769230769232) internal successors, (2097), 13 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,550 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,551 INFO L175 Difference]: Start difference. First operand has 108 places, 92 transitions, 859 flow. Second operand 13 states and 2097 transitions. [2023-08-26 12:50:27,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 245 transitions, 2429 flow [2023-08-26 12:50:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 245 transitions, 2263 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-08-26 12:50:27,626 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 868 flow [2023-08-26 12:50:27,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=868, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2023-08-26 12:50:27,627 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2023-08-26 12:50:27,627 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 868 flow [2023-08-26 12:50:27,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:27,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:27,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:50:27,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:27,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash 139565695, now seen corresponding path program 1 times [2023-08-26 12:50:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681185567] [2023-08-26 12:50:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681185567] [2023-08-26 12:50:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681185567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:50:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443433164] [2023-08-26 12:50:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:50:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:50:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:50:27,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 384 [2023-08-26 12:50:27,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:27,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 384 [2023-08-26 12:50:27,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:27,908 INFO L124 PetriNetUnfolderBase]: 304/1126 cut-off events. [2023-08-26 12:50:27,909 INFO L125 PetriNetUnfolderBase]: For 2521/2579 co-relation queries the response was YES. [2023-08-26 12:50:27,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4067 conditions, 1126 events. 304/1126 cut-off events. For 2521/2579 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8169 event pairs, 148 based on Foata normal form. 47/1167 useless extension candidates. Maximal degree in co-relation 4037. Up to 407 conditions per place. [2023-08-26 12:50:27,915 INFO L140 encePairwiseOnDemand]: 373/384 looper letters, 24 selfloop transitions, 13 changer transitions 14/75 dead transitions. [2023-08-26 12:50:27,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 75 transitions, 649 flow [2023-08-26 12:50:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:50:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:50:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-26 12:50:27,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3919270833333333 [2023-08-26 12:50:27,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-26 12:50:27,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-26 12:50:27,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:27,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-26 12:50:27,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,922 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,923 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 868 flow. Second operand 4 states and 602 transitions. [2023-08-26 12:50:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 75 transitions, 649 flow [2023-08-26 12:50:27,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 75 transitions, 539 flow, removed 15 selfloop flow, removed 19 redundant places. [2023-08-26 12:50:27,934 INFO L231 Difference]: Finished difference. Result has 89 places, 53 transitions, 335 flow [2023-08-26 12:50:27,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=89, PETRI_TRANSITIONS=53} [2023-08-26 12:50:27,935 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2023-08-26 12:50:27,935 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 53 transitions, 335 flow [2023-08-26 12:50:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:27,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:27,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:27,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:50:27,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t3_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:50:27,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 298131353, now seen corresponding path program 1 times [2023-08-26 12:50:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394914082] [2023-08-26 12:50:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394914082] [2023-08-26 12:50:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394914082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:28,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:50:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113640167] [2023-08-26 12:50:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:28,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:50:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:50:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:50:28,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 12:50:28,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 53 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:28,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:28,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 12:50:28,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:28,293 INFO L124 PetriNetUnfolderBase]: 324/856 cut-off events. [2023-08-26 12:50:28,293 INFO L125 PetriNetUnfolderBase]: For 1053/1061 co-relation queries the response was YES. [2023-08-26 12:50:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 856 events. 324/856 cut-off events. For 1053/1061 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4604 event pairs, 177 based on Foata normal form. 47/897 useless extension candidates. Maximal degree in co-relation 2950. Up to 403 conditions per place. [2023-08-26 12:50:28,296 INFO L140 encePairwiseOnDemand]: 378/384 looper letters, 0 selfloop transitions, 0 changer transitions 81/81 dead transitions. [2023-08-26 12:50:28,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 616 flow [2023-08-26 12:50:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:50:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:50:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1127 transitions. [2023-08-26 12:50:28,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2023-08-26 12:50:28,299 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1127 transitions. [2023-08-26 12:50:28,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1127 transitions. [2023-08-26 12:50:28,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:28,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1127 transitions. [2023-08-26 12:50:28,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:28,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:28,306 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:28,306 INFO L175 Difference]: Start difference. First operand has 89 places, 53 transitions, 335 flow. Second operand 7 states and 1127 transitions. [2023-08-26 12:50:28,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 616 flow [2023-08-26 12:50:28,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 551 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-08-26 12:50:28,310 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-08-26 12:50:28,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-08-26 12:50:28,311 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-08-26 12:50:28,311 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-08-26 12:50:28,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:50:28,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:50:28,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:50:28,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:50:28,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (6 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONASSERT (5 of 15 remaining) [2023-08-26 12:50:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:50:28,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:50:28,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:50:28,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONASSERT (1 of 15 remaining) [2023-08-26 12:50:28,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:50:28,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:50:28,316 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:28,321 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:50:28,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:50:28,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:50:28 BasicIcfg [2023-08-26 12:50:28,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:50:28,324 INFO L158 Benchmark]: Toolchain (without parser) took 19525.60ms. Allocated memory was 379.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 354.8MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 12:50:28,325 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory is still 356.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:50:28,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.46ms. Allocated memory is still 379.6MB. Free memory was 354.8MB in the beginning and 334.8MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 12:50:28,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.06ms. Allocated memory is still 379.6MB. Free memory was 334.8MB in the beginning and 332.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:50:28,325 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 379.6MB. Free memory was 332.3MB in the beginning and 330.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:50:28,325 INFO L158 Benchmark]: RCFGBuilder took 541.34ms. Allocated memory is still 379.6MB. Free memory was 330.7MB in the beginning and 311.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 12:50:28,326 INFO L158 Benchmark]: TraceAbstraction took 18538.85ms. Allocated memory was 379.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 311.4MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 12:50:28,327 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory is still 356.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 375.46ms. Allocated memory is still 379.6MB. Free memory was 354.8MB in the beginning and 334.8MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.06ms. Allocated memory is still 379.6MB. Free memory was 334.8MB in the beginning and 332.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 379.6MB. Free memory was 332.3MB in the beginning and 330.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 541.34ms. Allocated memory is still 379.6MB. Free memory was 330.7MB in the beginning and 311.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 18538.85ms. Allocated memory was 379.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 311.4MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 233]: Unsoundness Warning unspecified type, defaulting to int C: short [233] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 182 PlacesBefore, 53 PlacesAfterwards, 181 TransitionsBefore, 45 TransitionsAfterwards, 12214 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 116 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 200 TotalNumberOfCompositions, 27334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14344, independent: 13943, independent conditional: 0, independent unconditional: 13943, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6939, independent: 6878, independent conditional: 0, independent unconditional: 6878, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14344, independent: 7065, independent conditional: 0, independent unconditional: 7065, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 6939, unknown conditional: 0, unknown unconditional: 6939] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 15 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: 18.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 965 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 965 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2243 IncrementalHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 38 mSDtfsCounter, 2243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=13, InterpolantAutomatonStates: 89, 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.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-26 12:50:28,350 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...