/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:22:06,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:22:06,104 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 19:22:06,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:22:06,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:22:06,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:22:06,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:22:06,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:22:06,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:22:06,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:22:06,152 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:22:06,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:22:06,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:22:06,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:22:06,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:22:06,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:22:06,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:22:06,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:22:06,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:22:06,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:22:06,155 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:22:06,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:22:06,156 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:22:06,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:22:06,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:22:06,156 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:22:06,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:22:06,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:22:06,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:22:06,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:22:06,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:22:06,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:22:06,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:22:06,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:22:06,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:22:06,159 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:22:06,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:22:06,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:22:06,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:22:06,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:22:06,460 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:22:06,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-08-26 19:22:07,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:22:07,801 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:22:07,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-08-26 19:22:07,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc032556/08d53a78c7154c6e8f6b5df68d854201/FLAG004717670 [2023-08-26 19:22:07,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc032556/08d53a78c7154c6e8f6b5df68d854201 [2023-08-26 19:22:07,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:22:07,838 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:22:07,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:22:07,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:22:07,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:22:07,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:22:07" (1/1) ... [2023-08-26 19:22:07,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbd30f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:07, skipping insertion in model container [2023-08-26 19:22:07,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:22:07" (1/1) ... [2023-08-26 19:22:07,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:22:08,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:22:08,064 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:22:08,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:22:08,115 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:22:08,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08 WrapperNode [2023-08-26 19:22:08,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:22:08,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:22:08,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:22:08,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:22:08,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,165 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 19:22:08,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:22:08,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:22:08,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:22:08,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:22:08,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:22:08,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:22:08,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:22:08,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:22:08,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (1/1) ... [2023-08-26 19:22:08,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:22:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:08,227 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 19:22:08,253 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 19:22:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:22:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:22:08,272 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:22:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:22:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:22:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 19:22:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 19:22:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 19:22:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 19:22:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:22:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:22:08,276 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 19:22:08,371 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:22:08,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:22:08,702 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:22:08,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:22:08,711 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 19:22:08,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:22:08 BoogieIcfgContainer [2023-08-26 19:22:08,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:22:08,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:22:08,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:22:08,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:22:08,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:22:07" (1/3) ... [2023-08-26 19:22:08,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302582a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:22:08, skipping insertion in model container [2023-08-26 19:22:08,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:22:08" (2/3) ... [2023-08-26 19:22:08,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302582a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:22:08, skipping insertion in model container [2023-08-26 19:22:08,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:22:08" (3/3) ... [2023-08-26 19:22:08,723 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2023-08-26 19:22:08,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:22:08,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 19:22:08,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:22:08,841 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 19:22:08,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 164 transitions, 360 flow [2023-08-26 19:22:08,967 INFO L124 PetriNetUnfolderBase]: 10/160 cut-off events. [2023-08-26 19:22:08,968 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:22:08,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 160 events. 10/160 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 190 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-26 19:22:08,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 164 transitions, 360 flow [2023-08-26 19:22:08,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 147 transitions, 318 flow [2023-08-26 19:22:08,985 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:22:08,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 147 transitions, 318 flow [2023-08-26 19:22:09,000 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 147 transitions, 318 flow [2023-08-26 19:22:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 147 transitions, 318 flow [2023-08-26 19:22:09,048 INFO L124 PetriNetUnfolderBase]: 10/147 cut-off events. [2023-08-26 19:22:09,049 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:22:09,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 147 events. 10/147 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 189 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-26 19:22:09,055 INFO L119 LiptonReduction]: Number of co-enabled transitions 4080 [2023-08-26 19:22:13,816 INFO L134 LiptonReduction]: Checked pairs total: 4097 [2023-08-26 19:22:13,816 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-26 19:22:13,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:22:13,832 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;@7c37d8d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:22:13,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 19:22:13,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:22:13,834 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 19:22:13,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:13,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:13,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:22:13,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:13,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2023-08-26 19:22:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123047039] [2023-08-26 19:22:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:13,925 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 19:22:13,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123047039] [2023-08-26 19:22:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123047039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:13,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:22:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740916757] [2023-08-26 19:22:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:13,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:22:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:22:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:22:13,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 312 [2023-08-26 19:22:13,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 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 19:22:13,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:13,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 312 [2023-08-26 19:22:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:14,085 INFO L124 PetriNetUnfolderBase]: 513/692 cut-off events. [2023-08-26 19:22:14,086 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 19:22:14,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1634 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-08-26 19:22:14,093 INFO L140 encePairwiseOnDemand]: 310/312 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 19:22:14,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-08-26 19:22:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:22:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:22:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-08-26 19:22:14,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432692307692307 [2023-08-26 19:22:14,113 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-08-26 19:22:14,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-08-26 19:22:14,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:14,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-08-26 19:22:14,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 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 19:22:14,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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 19:22:14,127 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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 19:22:14,129 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 2 states and 339 transitions. [2023-08-26 19:22:14,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-08-26 19:22:14,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 19:22:14,135 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-08-26 19:22:14,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-26 19:22:14,140 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:22:14,140 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-08-26 19:22:14,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 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 19:22:14,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:14,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:22:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:22:14,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:14,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 591001, now seen corresponding path program 1 times [2023-08-26 19:22:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400900610] [2023-08-26 19:22:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:14,525 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 19:22:14,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400900610] [2023-08-26 19:22:14,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400900610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:14,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208796868] [2023-08-26 19:22:14,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:14,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 19:22:14,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 19:22:14,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:14,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 19:22:14,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:14,621 INFO L124 PetriNetUnfolderBase]: 487/656 cut-off events. [2023-08-26 19:22:14,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:14,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1523 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-08-26 19:22:14,625 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 19:22:14,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-08-26 19:22:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-26 19:22:14,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198717948717949 [2023-08-26 19:22:14,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-26 19:22:14,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-26 19:22:14,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:14,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-26 19:22:14,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 19:22:14,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:14,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:14,633 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 393 transitions. [2023-08-26 19:22:14,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-08-26 19:22:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:22:14,636 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-26 19:22:14,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-26 19:22:14,637 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:22:14,639 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-26 19:22:14,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 19:22:14,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:14,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:22:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:22:14,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:14,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash 591000, now seen corresponding path program 1 times [2023-08-26 19:22:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216689950] [2023-08-26 19:22:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:14,828 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 19:22:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216689950] [2023-08-26 19:22:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216689950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831357112] [2023-08-26 19:22:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:14,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:14,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 312 [2023-08-26 19:22:14,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 19:22:14,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:14,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 312 [2023-08-26 19:22:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:14,931 INFO L124 PetriNetUnfolderBase]: 461/620 cut-off events. [2023-08-26 19:22:14,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:14,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1426 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-08-26 19:22:14,934 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 19:22:14,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-08-26 19:22:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-26 19:22:14,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2023-08-26 19:22:14,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-26 19:22:14,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-26 19:22:14,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:14,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-26 19:22:14,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 19:22:14,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:14,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:14,940 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 403 transitions. [2023-08-26 19:22:14,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-08-26 19:22:14,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:14,941 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-08-26 19:22:14,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-26 19:22:14,942 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 19:22:14,942 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-08-26 19:22:14,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 19:22:14,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:14,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:22:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:22:14,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:14,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 567966233, now seen corresponding path program 1 times [2023-08-26 19:22:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085080788] [2023-08-26 19:22:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,027 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 19:22:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085080788] [2023-08-26 19:22:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085080788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826615860] [2023-08-26 19:22:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:15,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 19:22:15,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 19:22:15,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 19:22:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,098 INFO L124 PetriNetUnfolderBase]: 445/596 cut-off events. [2023-08-26 19:22:15,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1357 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-08-26 19:22:15,102 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 19:22:15,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-08-26 19:22:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-26 19:22:15,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4155982905982906 [2023-08-26 19:22:15,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-26 19:22:15,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-26 19:22:15,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-26 19:22:15,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 19:22:15,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,107 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 389 transitions. [2023-08-26 19:22:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-08-26 19:22:15,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,109 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-08-26 19:22:15,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-26 19:22:15,109 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 19:22:15,110 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-08-26 19:22:15,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 19:22:15,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:22:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:22:15,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 567966232, now seen corresponding path program 1 times [2023-08-26 19:22:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728306732] [2023-08-26 19:22:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,183 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 19:22:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728306732] [2023-08-26 19:22:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728306732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840290300] [2023-08-26 19:22:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:15,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 312 [2023-08-26 19:22:15,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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 19:22:15,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 312 [2023-08-26 19:22:15,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,251 INFO L124 PetriNetUnfolderBase]: 429/572 cut-off events. [2023-08-26 19:22:15,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1288 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-08-26 19:22:15,255 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 19:22:15,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-08-26 19:22:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-26 19:22:15,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42628205128205127 [2023-08-26 19:22:15,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-26 19:22:15,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-26 19:22:15,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-26 19:22:15,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:15,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,260 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 399 transitions. [2023-08-26 19:22:15,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-08-26 19:22:15,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,261 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-08-26 19:22:15,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 19:22:15,262 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:22:15,262 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-08-26 19:22:15,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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 19:22:15,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:22:15,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:22:15,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash 354714904, now seen corresponding path program 1 times [2023-08-26 19:22:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879207640] [2023-08-26 19:22:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,314 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 19:22:15,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879207640] [2023-08-26 19:22:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879207640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743156544] [2023-08-26 19:22:15,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:15,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 19:22:15,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:15,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 19:22:15,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,376 INFO L124 PetriNetUnfolderBase]: 403/536 cut-off events. [2023-08-26 19:22:15,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1181 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-08-26 19:22:15,379 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 19:22:15,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-08-26 19:22:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-26 19:22:15,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113247863247863 [2023-08-26 19:22:15,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-26 19:22:15,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-26 19:22:15,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-26 19:22:15,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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 19:22:15,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,384 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 385 transitions. [2023-08-26 19:22:15,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-08-26 19:22:15,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,385 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-08-26 19:22:15,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-26 19:22:15,386 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2023-08-26 19:22:15,386 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-08-26 19:22:15,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:15,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:22:15,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:22:15,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash 354714903, now seen corresponding path program 1 times [2023-08-26 19:22:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255491984] [2023-08-26 19:22:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,441 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 19:22:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255491984] [2023-08-26 19:22:15,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255491984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958068119] [2023-08-26 19:22:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:15,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 312 [2023-08-26 19:22:15,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 19:22:15,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 312 [2023-08-26 19:22:15,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,521 INFO L124 PetriNetUnfolderBase]: 377/500 cut-off events. [2023-08-26 19:22:15,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1074 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-08-26 19:22:15,524 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 19:22:15,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-08-26 19:22:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-26 19:22:15,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.422008547008547 [2023-08-26 19:22:15,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-26 19:22:15,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-26 19:22:15,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-26 19:22:15,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 19:22:15,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,529 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 395 transitions. [2023-08-26 19:22:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-08-26 19:22:15,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,530 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-08-26 19:22:15,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-26 19:22:15,530 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:22:15,531 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-08-26 19:22:15,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 19:22:15,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:22:15,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:22:15,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1578620653, now seen corresponding path program 1 times [2023-08-26 19:22:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300984327] [2023-08-26 19:22:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,651 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 19:22:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300984327] [2023-08-26 19:22:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300984327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:22:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101166419] [2023-08-26 19:22:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:22:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:22:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:22:15,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 312 [2023-08-26 19:22:15,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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 19:22:15,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 312 [2023-08-26 19:22:15,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,714 INFO L124 PetriNetUnfolderBase]: 313/420 cut-off events. [2023-08-26 19:22:15,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2023-08-26 19:22:15,717 INFO L140 encePairwiseOnDemand]: 310/312 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-26 19:22:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-08-26 19:22:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-26 19:22:15,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2023-08-26 19:22:15,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-26 19:22:15,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-26 19:22:15,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-26 19:22:15,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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 19:22:15,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,722 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 354 transitions. [2023-08-26 19:22:15,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-08-26 19:22:15,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,723 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-08-26 19:22:15,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-26 19:22:15,723 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:22:15,724 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-08-26 19:22:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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 19:22:15,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:22:15,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:22:15,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1578620652, now seen corresponding path program 1 times [2023-08-26 19:22:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828849261] [2023-08-26 19:22:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828849261] [2023-08-26 19:22:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828849261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490959778] [2023-08-26 19:22:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:15,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:15,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 312 [2023-08-26 19:22:15,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 19:22:15,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:15,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 312 [2023-08-26 19:22:15,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:15,812 INFO L124 PetriNetUnfolderBase]: 249/340 cut-off events. [2023-08-26 19:22:15,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:15,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 641 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-08-26 19:22:15,814 INFO L140 encePairwiseOnDemand]: 310/312 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-26 19:22:15,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-08-26 19:22:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-26 19:22:15,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2023-08-26 19:22:15,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-26 19:22:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-26 19:22:15,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:15,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-26 19:22:15,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 19:22:15,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:15,819 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 392 transitions. [2023-08-26 19:22:15,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-08-26 19:22:15,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:15,820 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-08-26 19:22:15,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-26 19:22:15,821 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:22:15,821 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-08-26 19:22:15,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 19:22:15,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:15,822 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 19:22:15,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:22:15,822 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:15,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 693642297, now seen corresponding path program 1 times [2023-08-26 19:22:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:15,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102090636] [2023-08-26 19:22:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:16,019 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 19:22:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102090636] [2023-08-26 19:22:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102090636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:16,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:22:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171078893] [2023-08-26 19:22:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:16,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:22:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:22:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:22:16,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 312 [2023-08-26 19:22:16,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 19:22:16,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:16,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 312 [2023-08-26 19:22:16,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:16,130 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-26 19:22:16,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:22:16,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-08-26 19:22:16,134 INFO L140 encePairwiseOnDemand]: 306/312 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-26 19:22:16,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-08-26 19:22:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:22:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:22:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 19:22:16,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814102564102564 [2023-08-26 19:22:16,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 19:22:16,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 19:22:16,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:16,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 19:22:16,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 19:22:16,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:16,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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 19:22:16,140 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 357 transitions. [2023-08-26 19:22:16,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-08-26 19:22:16,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:16,142 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-08-26 19:22:16,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 19:22:16,144 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:22:16,144 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-08-26 19:22:16,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 19:22:16,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:16,144 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, 1] [2023-08-26 19:22:16,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:22:16,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:16,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash 30675804, now seen corresponding path program 1 times [2023-08-26 19:22:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862995956] [2023-08-26 19:22:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:16,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862995956] [2023-08-26 19:22:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862995956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:22:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191536248] [2023-08-26 19:22:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:16,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:22:16,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:16,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:22:16,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:22:16,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 19:22:16,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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 19:22:16,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:16,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 19:22:16,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:16,475 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-26 19:22:16,476 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2023-08-26 19:22:16,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1831 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 1645. Up to 435 conditions per place. [2023-08-26 19:22:16,479 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-26 19:22:16,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 297 flow [2023-08-26 19:22:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:22:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:22:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 19:22:16,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3733974358974359 [2023-08-26 19:22:16,481 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 19:22:16,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 19:22:16,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:16,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 19:22:16,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 19:22:16,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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 19:22:16,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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 19:22:16,485 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 4 states and 466 transitions. [2023-08-26 19:22:16,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 297 flow [2023-08-26 19:22:16,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:16,487 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2023-08-26 19:22:16,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 19:22:16,488 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:22:16,488 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2023-08-26 19:22:16,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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 19:22:16,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:16,488 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, 1] [2023-08-26 19:22:16,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:22:16,488 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:16,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash -318354850, now seen corresponding path program 1 times [2023-08-26 19:22:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488585162] [2023-08-26 19:22:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488585162] [2023-08-26 19:22:16,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488585162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:16,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:22:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911130818] [2023-08-26 19:22:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:16,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:22:16,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:22:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:22:16,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 312 [2023-08-26 19:22:16,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:16,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:16,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 312 [2023-08-26 19:22:16,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:16,821 INFO L124 PetriNetUnfolderBase]: 657/915 cut-off events. [2023-08-26 19:22:16,821 INFO L125 PetriNetUnfolderBase]: For 659/659 co-relation queries the response was YES. [2023-08-26 19:22:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 915 events. 657/915 cut-off events. For 659/659 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2759 event pairs, 55 based on Foata normal form. 32/947 useless extension candidates. Maximal degree in co-relation 2533. Up to 349 conditions per place. [2023-08-26 19:22:16,827 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-08-26 19:22:16,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 479 flow [2023-08-26 19:22:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:22:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:22:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-26 19:22:16,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42756410256410254 [2023-08-26 19:22:16,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-26 19:22:16,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-26 19:22:16,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:16,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-26 19:22:16,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 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 19:22:16,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:16,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:16,834 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 5 states and 667 transitions. [2023-08-26 19:22:16,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 479 flow [2023-08-26 19:22:16,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:22:16,838 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 200 flow [2023-08-26 19:22:16,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-26 19:22:16,840 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-26 19:22:16,840 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 200 flow [2023-08-26 19:22:16,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:16,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:16,840 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, 1] [2023-08-26 19:22:16,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 19:22:16,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:16,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -922952039, now seen corresponding path program 1 times [2023-08-26 19:22:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581921283] [2023-08-26 19:22:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:16,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581921283] [2023-08-26 19:22:16,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581921283] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:22:16,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236090120] [2023-08-26 19:22:16,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:16,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:16,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:16,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:22:17,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:22:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:17,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:22:17,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:17,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236090120] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:17,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:22:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219917334] [2023-08-26 19:22:17,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:17,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:22:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:22:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:22:17,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 312 [2023-08-26 19:22:17,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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 19:22:17,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 312 [2023-08-26 19:22:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:17,543 INFO L124 PetriNetUnfolderBase]: 807/1127 cut-off events. [2023-08-26 19:22:17,543 INFO L125 PetriNetUnfolderBase]: For 1098/1098 co-relation queries the response was YES. [2023-08-26 19:22:17,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1127 events. 807/1127 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3512 event pairs, 223 based on Foata normal form. 30/1127 useless extension candidates. Maximal degree in co-relation 3762. Up to 509 conditions per place. [2023-08-26 19:22:17,552 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-08-26 19:22:17,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 520 flow [2023-08-26 19:22:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:22:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:22:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-26 19:22:17,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288461538461538 [2023-08-26 19:22:17,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-26 19:22:17,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-26 19:22:17,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:17,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-26 19:22:17,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 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 19:22:17,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:17,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:17,560 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 200 flow. Second operand 5 states and 669 transitions. [2023-08-26 19:22:17,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 520 flow [2023-08-26 19:22:17,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:22:17,565 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 264 flow [2023-08-26 19:22:17,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-26 19:22:17,566 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 19:22:17,566 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 264 flow [2023-08-26 19:22:17,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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 19:22:17,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:17,567 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, 1] [2023-08-26 19:22:17,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:22:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 19:22:17,772 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:17,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash 192995537, now seen corresponding path program 2 times [2023-08-26 19:22:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222125834] [2023-08-26 19:22:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222125834] [2023-08-26 19:22:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222125834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:22:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:22:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:22:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913722401] [2023-08-26 19:22:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:22:18,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:22:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:22:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:22:18,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 19:22:18,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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 19:22:18,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:18,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 19:22:18,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:18,208 INFO L124 PetriNetUnfolderBase]: 793/1113 cut-off events. [2023-08-26 19:22:18,208 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2023-08-26 19:22:18,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1113 events. 793/1113 cut-off events. For 1790/1790 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3586 event pairs, 135 based on Foata normal form. 14/1097 useless extension candidates. Maximal degree in co-relation 4055. Up to 907 conditions per place. [2023-08-26 19:22:18,216 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2023-08-26 19:22:18,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 503 flow [2023-08-26 19:22:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:22:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:22:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-26 19:22:18,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37259615384615385 [2023-08-26 19:22:18,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-26 19:22:18,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-26 19:22:18,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:18,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-26 19:22:18,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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 19:22:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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 19:22:18,222 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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 19:22:18,222 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 264 flow. Second operand 4 states and 465 transitions. [2023-08-26 19:22:18,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 503 flow [2023-08-26 19:22:18,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 491 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:18,231 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 288 flow [2023-08-26 19:22:18,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-26 19:22:18,232 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 19:22:18,233 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 288 flow [2023-08-26 19:22:18,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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 19:22:18,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:18,233 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, 1] [2023-08-26 19:22:18,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:22:18,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:18,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1026870948, now seen corresponding path program 2 times [2023-08-26 19:22:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243361972] [2023-08-26 19:22:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:18,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243361972] [2023-08-26 19:22:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243361972] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:22:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766006522] [2023-08-26 19:22:18,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:22:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:18,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:18,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:22:18,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:22:18,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:22:18,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:22:18,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:22:18,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:18,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766006522] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:18,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:22:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653970030] [2023-08-26 19:22:18,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:18,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:22:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:22:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:22:18,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 19:22:18,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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 19:22:18,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:18,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 19:22:18,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:18,974 INFO L124 PetriNetUnfolderBase]: 881/1229 cut-off events. [2023-08-26 19:22:18,974 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2023-08-26 19:22:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 1229 events. 881/1229 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3956 event pairs, 159 based on Foata normal form. 28/1257 useless extension candidates. Maximal degree in co-relation 4701. Up to 605 conditions per place. [2023-08-26 19:22:18,983 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 84 selfloop transitions, 15 changer transitions 3/102 dead transitions. [2023-08-26 19:22:18,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 686 flow [2023-08-26 19:22:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:22:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:22:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-08-26 19:22:18,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2023-08-26 19:22:18,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-08-26 19:22:18,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-08-26 19:22:18,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:18,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-08-26 19:22:18,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:22:18,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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 19:22:18,990 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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 19:22:18,990 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 288 flow. Second operand 6 states and 696 transitions. [2023-08-26 19:22:18,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 686 flow [2023-08-26 19:22:18,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:18,996 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 348 flow [2023-08-26 19:22:18,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-26 19:22:18,997 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-26 19:22:18,997 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 348 flow [2023-08-26 19:22:18,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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 19:22:18,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:18,998 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, 1] [2023-08-26 19:22:19,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:22:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 19:22:19,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:19,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2101633282, now seen corresponding path program 2 times [2023-08-26 19:22:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91034812] [2023-08-26 19:22:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91034812] [2023-08-26 19:22:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91034812] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:22:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539756829] [2023-08-26 19:22:19,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:22:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:19,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:22:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:22:19,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:22:19,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:22:19,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:22:19,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:19,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:19,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539756829] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:19,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:19,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:22:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607197723] [2023-08-26 19:22:19,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:19,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:22:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:22:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:22:19,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 312 [2023-08-26 19:22:19,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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 19:22:19,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:19,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 312 [2023-08-26 19:22:19,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:19,986 INFO L124 PetriNetUnfolderBase]: 1771/2439 cut-off events. [2023-08-26 19:22:19,986 INFO L125 PetriNetUnfolderBase]: For 7939/7939 co-relation queries the response was YES. [2023-08-26 19:22:19,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 2439 events. 1771/2439 cut-off events. For 7939/7939 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8987 event pairs, 343 based on Foata normal form. 104/2543 useless extension candidates. Maximal degree in co-relation 10132. Up to 1123 conditions per place. [2023-08-26 19:22:20,006 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 125 selfloop transitions, 10 changer transitions 0/135 dead transitions. [2023-08-26 19:22:20,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 135 transitions, 1150 flow [2023-08-26 19:22:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:22:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:22:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-26 19:22:20,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.433974358974359 [2023-08-26 19:22:20,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-26 19:22:20,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-26 19:22:20,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:20,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-26 19:22:20,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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 19:22:20,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:20,013 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:20,013 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 348 flow. Second operand 5 states and 677 transitions. [2023-08-26 19:22:20,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 135 transitions, 1150 flow [2023-08-26 19:22:20,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 135 transitions, 1093 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-26 19:22:20,031 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 391 flow [2023-08-26 19:22:20,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-08-26 19:22:20,031 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-26 19:22:20,031 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 391 flow [2023-08-26 19:22:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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 19:22:20,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:20,032 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, 1] [2023-08-26 19:22:20,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:22:20,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:20,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:20,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2043837881, now seen corresponding path program 1 times [2023-08-26 19:22:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085955794] [2023-08-26 19:22:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085955794] [2023-08-26 19:22:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085955794] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:22:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372599692] [2023-08-26 19:22:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:20,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:20,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:22:20,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:22:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:20,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:22:20,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:20,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372599692] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:20,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:22:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258956308] [2023-08-26 19:22:20,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:20,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:22:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:22:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:22:20,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 312 [2023-08-26 19:22:20,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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 19:22:20,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:20,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 312 [2023-08-26 19:22:20,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:21,045 INFO L124 PetriNetUnfolderBase]: 2241/3081 cut-off events. [2023-08-26 19:22:21,046 INFO L125 PetriNetUnfolderBase]: For 10974/10974 co-relation queries the response was YES. [2023-08-26 19:22:21,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14116 conditions, 3081 events. 2241/3081 cut-off events. For 10974/10974 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11790 event pairs, 551 based on Foata normal form. 76/3157 useless extension candidates. Maximal degree in co-relation 14097. Up to 1757 conditions per place. [2023-08-26 19:22:21,077 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 128 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2023-08-26 19:22:21,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 138 transitions, 1171 flow [2023-08-26 19:22:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:22:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:22:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-26 19:22:21,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.433974358974359 [2023-08-26 19:22:21,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-26 19:22:21,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-26 19:22:21,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:22:21,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-26 19:22:21,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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 19:22:21,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:21,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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 19:22:21,085 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 391 flow. Second operand 5 states and 677 transitions. [2023-08-26 19:22:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 138 transitions, 1171 flow [2023-08-26 19:22:21,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 138 transitions, 1169 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 19:22:21,125 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 444 flow [2023-08-26 19:22:21,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=444, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2023-08-26 19:22:21,125 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-26 19:22:21,126 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 444 flow [2023-08-26 19:22:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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 19:22:21,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:22:21,126 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, 1, 1] [2023-08-26 19:22:21,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:22:21,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 19:22:21,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:22:21,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:22:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2075254838, now seen corresponding path program 1 times [2023-08-26 19:22:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:22:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852419793] [2023-08-26 19:22:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:22:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:22:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852419793] [2023-08-26 19:22:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852419793] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:22:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119768365] [2023-08-26 19:22:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:22:22,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:22:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:22:22,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:22:22,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 19:22:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:23,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:22:23,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:12,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119768365] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:24,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:24,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-08-26 19:23:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127693985] [2023-08-26 19:23:24,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:24,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 19:23:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 19:23:24,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=186, Unknown=17, NotChecked=0, Total=272 [2023-08-26 19:23:24,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 19:23:24,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 444 flow. Second operand has 17 states, 17 states have (on average 104.6470588235294) internal successors, (1779), 17 states have internal predecessors, (1779), 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 19:23:24,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:24,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 19:23:24,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:54,267 WARN L234 SmtUtils]: Spent 24.97s on a formula simplification. DAG size of input: 75 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:23:56,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:58,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:05,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:09,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:11,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:22,316 WARN L234 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 64 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:24:24,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:34,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:36,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:39,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:40,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:41,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:44,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:46,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:48,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:50,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:55,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:57,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:59,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:01,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:04,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:06,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:15,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:17,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:19,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:21,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:23,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:25,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:27,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:29,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:31,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:33,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:35,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:37,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:12,167 WARN L234 SmtUtils]: Spent 25.48s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:26:20,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:23,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:25,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:27,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:29,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:31,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:33,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:34,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:47,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:49,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:51,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:53,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:55,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:59,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:03,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:05,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:07,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:10,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:12,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:15,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:17,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:19,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:21,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:23,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:25,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:27,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:29,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:32,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:34,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:36,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:38,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:39,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:54,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:22,211 WARN L234 SmtUtils]: Spent 21.33s on a formula simplification. DAG size of input: 61 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:28:23,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:26,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:28,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:29,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:40,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:42,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:45,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:47,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:49,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:51,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:54,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:56,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:58,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:00,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:03,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:05,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:07,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:09,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:12,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:13,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:15,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:17,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:19,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:21,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:24,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:26,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:28,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:31,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:33,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:35,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:37,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:40,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:42,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:44,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:46,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:48,473 INFO L124 PetriNetUnfolderBase]: 3975/5537 cut-off events. [2023-08-26 19:29:48,474 INFO L125 PetriNetUnfolderBase]: For 23847/23847 co-relation queries the response was YES. [2023-08-26 19:29:48,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27295 conditions, 5537 events. 3975/5537 cut-off events. For 23847/23847 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24458 event pairs, 533 based on Foata normal form. 40/5577 useless extension candidates. Maximal degree in co-relation 27273. Up to 3376 conditions per place. [2023-08-26 19:29:48,526 INFO L140 encePairwiseOnDemand]: 301/312 looper letters, 199 selfloop transitions, 89 changer transitions 37/325 dead transitions. [2023-08-26 19:29:48,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 325 transitions, 2661 flow [2023-08-26 19:29:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 19:29:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 19:29:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2199 transitions. [2023-08-26 19:29:48,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709514170040486 [2023-08-26 19:29:48,533 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2199 transitions. [2023-08-26 19:29:48,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2199 transitions. [2023-08-26 19:29:48,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:29:48,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2199 transitions. [2023-08-26 19:29:48,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.73684210526316) internal successors, (2199), 19 states have internal predecessors, (2199), 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 19:29:48,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 312.0) internal successors, (6240), 20 states have internal predecessors, (6240), 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 19:29:48,547 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 312.0) internal successors, (6240), 20 states have internal predecessors, (6240), 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 19:29:48,547 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 444 flow. Second operand 19 states and 2199 transitions. [2023-08-26 19:29:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 325 transitions, 2661 flow [2023-08-26 19:29:48,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 325 transitions, 2551 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-26 19:29:48,593 INFO L231 Difference]: Finished difference. Result has 101 places, 139 transitions, 1430 flow [2023-08-26 19:29:48,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1430, PETRI_PLACES=101, PETRI_TRANSITIONS=139} [2023-08-26 19:29:48,594 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2023-08-26 19:29:48,594 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 139 transitions, 1430 flow [2023-08-26 19:29:48,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 104.6470588235294) internal successors, (1779), 17 states have internal predecessors, (1779), 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 19:29:48,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:29:48,595 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, 1, 1] [2023-08-26 19:29:48,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 19:29:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 19:29:48,801 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:29:48,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:29:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1339812654, now seen corresponding path program 1 times [2023-08-26 19:29:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:29:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165191854] [2023-08-26 19:29:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:29:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:29:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:29:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:29:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:29:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165191854] [2023-08-26 19:29:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165191854] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:29:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468713779] [2023-08-26 19:29:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:29:49,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:29:49,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:29:49,273 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:29:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 19:34:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:34:32,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:34:32,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:36:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:36:07,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:36:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:36:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468713779] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:36:33,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:36:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 19:36:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295413496] [2023-08-26 19:36:33,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:36:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:36:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:36:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:36:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=164, Unknown=26, NotChecked=0, Total=240 [2023-08-26 19:36:33,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 19:36:33,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 139 transitions, 1430 flow. Second operand has 16 states, 16 states have (on average 104.6875) internal successors, (1675), 16 states have internal predecessors, (1675), 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 19:36:33,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:36:33,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 19:36:33,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:36:35,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 19:36:42,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:36:42,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:36:42,661 WARN L266 SmtUtils]: Removed 3 from assertion stack [2023-08-26 19:36:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:36:42,662 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 19:36:42,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 19:36:42,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:36:42,863 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-08-26 19:36:42,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2023-08-26 19:36:42,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2023-08-26 19:36:42,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 21 remaining) [2023-08-26 19:36:42,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 21 remaining) [2023-08-26 19:36:42,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 21 remaining) [2023-08-26 19:36:42,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 21 remaining) [2023-08-26 19:36:42,867 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:36:42,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:36:42,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:36:42,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:36:42 BasicIcfg [2023-08-26 19:36:42,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:36:42,875 INFO L158 Benchmark]: Toolchain (without parser) took 875036.76ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 356.1MB in the beginning and 290.6MB in the end (delta: 65.4MB). Peak memory consumption was 246.6MB. Max. memory is 16.0GB. [2023-08-26 19:36:42,875 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 400.6MB. Free memory was 378.2MB in the beginning and 378.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:36:42,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.88ms. Allocated memory is still 400.6MB. Free memory was 355.8MB in the beginning and 344.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 19:36:42,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 400.6MB. Free memory was 344.3MB in the beginning and 342.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:36:42,876 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 400.6MB. Free memory was 342.2MB in the beginning and 341.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:36:42,876 INFO L158 Benchmark]: RCFGBuilder took 511.97ms. Allocated memory is still 400.6MB. Free memory was 341.1MB in the beginning and 320.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 19:36:42,876 INFO L158 Benchmark]: TraceAbstraction took 874159.60ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 320.2MB in the beginning and 290.6MB in the end (delta: 29.5MB). Peak memory consumption was 210.9MB. Max. memory is 16.0GB. [2023-08-26 19:36:42,877 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.13ms. Allocated memory is still 400.6MB. Free memory was 378.2MB in the beginning and 378.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 275.88ms. Allocated memory is still 400.6MB. Free memory was 355.8MB in the beginning and 344.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 400.6MB. Free memory was 344.3MB in the beginning and 342.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 400.6MB. Free memory was 342.2MB in the beginning and 341.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 511.97ms. Allocated memory is still 400.6MB. Free memory was 341.1MB in the beginning and 320.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 874159.60ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 320.2MB in the beginning and 290.6MB in the end (delta: 29.5MB). Peak memory consumption was 210.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 150 PlacesBefore, 50 PlacesAfterwards, 147 TransitionsBefore, 41 TransitionsAfterwards, 4080 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 148 TotalNumberOfCompositions, 4097 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4097, independent: 4097, independent conditional: 0, independent unconditional: 4097, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2142, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4097, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2142, unknown conditional: 0, unknown unconditional: 2142] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 70 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 203 locations, 21 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: 874.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 396.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 95 mSolverCounterUnknown, 714 SdHoareTripleChecker+Valid, 231.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 229.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2081 IncrementalHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 0 mSDtfsCounter, 2081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 226 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 267.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1430occurred in iteration=18, InterpolantAutomatonStates: 82, 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.1s SsaConstructionTime, 285.8s SatisfiabilityAnalysisTime, 184.9s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 12882 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1374 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 3/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown