/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/goblint-regression/28-race_reach_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:10:38,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:10:38,726 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:10:38,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:10:38,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:10:38,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:10:38,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:10:38,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:10:38,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:10:38,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:10:38,779 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:10:38,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:10:38,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:10:38,780 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:10:38,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:10:38,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:10:38,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:10:38,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:10:38,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:10:38,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:10:38,781 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:10:38,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:10:38,783 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:10:38,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:10:38,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:10:38,784 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:10:38,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:10:38,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:10:38,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:10:38,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:10:38,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:10:38,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:10:38,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:10:38,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:10:38,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:10:38,786 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:10:39,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:10:39,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:10:39,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:10:39,147 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:10:39,147 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:10:39,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2023-08-26 19:10:40,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:10:40,632 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:10:40,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2023-08-26 19:10:40,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17c72d42/93cdfa1ea2e146c2a8c4069ae32bd9d5/FLAG896c4d0e3 [2023-08-26 19:10:40,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17c72d42/93cdfa1ea2e146c2a8c4069ae32bd9d5 [2023-08-26 19:10:40,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:10:40,672 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:10:40,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:10:40,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:10:40,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:10:40,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:10:40" (1/1) ... [2023-08-26 19:10:40,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c4dc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:40, skipping insertion in model container [2023-08-26 19:10:40,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:10:40" (1/1) ... [2023-08-26 19:10:40,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:10:41,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:10:41,195 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:10:41,207 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 19:10:41,209 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 19:10:41,217 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 19:10:41,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:10:41,296 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:10:41,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41 WrapperNode [2023-08-26 19:10:41,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:10:41,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:10:41,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:10:41,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:10:41,304 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:10:41" (1/1) ... [2023-08-26 19:10:41,319 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:10:41" (1/1) ... [2023-08-26 19:10:41,348 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 202 [2023-08-26 19:10:41,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:10:41,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:10:41,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:10:41,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:10:41,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:10:41,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:10:41,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:10:41,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:10:41,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (1/1) ... [2023-08-26 19:10:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:10:41,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:41,451 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:10:41,464 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:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:10:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 19:10:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:10:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 19:10:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 19:10:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:10:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:10:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:10:41,493 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:10:41,611 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:10:41,612 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:10:41,918 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:10:41,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:10:41,924 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 19:10:41,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:10:41 BoogieIcfgContainer [2023-08-26 19:10:41,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:10:41,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:10:41,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:10:41,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:10:41,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:10:40" (1/3) ... [2023-08-26 19:10:41,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341d4f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:10:41, skipping insertion in model container [2023-08-26 19:10:41,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:10:41" (2/3) ... [2023-08-26 19:10:41,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341d4f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:10:41, skipping insertion in model container [2023-08-26 19:10:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:10:41" (3/3) ... [2023-08-26 19:10:41,932 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2023-08-26 19:10:41,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:10:41,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-08-26 19:10:41,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:10:42,076 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 19:10:42,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,244 INFO L124 PetriNetUnfolderBase]: 48/318 cut-off events. [2023-08-26 19:10:42,245 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 19:10:42,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 318 events. 48/318 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1193 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 180. Up to 8 conditions per place. [2023-08-26 19:10:42,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,270 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:10:42,281 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,285 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:42,341 INFO L124 PetriNetUnfolderBase]: 48/318 cut-off events. [2023-08-26 19:10:42,341 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 19:10:42,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 318 events. 48/318 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1193 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 180. Up to 8 conditions per place. [2023-08-26 19:10:42,354 INFO L119 LiptonReduction]: Number of co-enabled transitions 16320 [2023-08-26 19:10:46,266 INFO L134 LiptonReduction]: Checked pairs total: 30848 [2023-08-26 19:10:46,267 INFO L136 LiptonReduction]: Total number of compositions: 217 [2023-08-26 19:10:46,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:10:46,282 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;@38bddf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:10:46,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-08-26 19:10:46,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:10:46,285 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2023-08-26 19:10:46,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:46,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:46,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:10:46,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:46,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 914444, now seen corresponding path program 1 times [2023-08-26 19:10:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584116301] [2023-08-26 19:10:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:46,462 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:10:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584116301] [2023-08-26 19:10:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584116301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:10:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94372247] [2023-08-26 19:10:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:46,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:10:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:10:46,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:10:46,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 445 [2023-08-26 19:10:46,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 92 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:10:46,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:46,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 445 [2023-08-26 19:10:46,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:46,747 INFO L124 PetriNetUnfolderBase]: 563/1291 cut-off events. [2023-08-26 19:10:46,747 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:10:46,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 1291 events. 563/1291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8513 event pairs, 513 based on Foata normal form. 98/936 useless extension candidates. Maximal degree in co-relation 2324. Up to 1105 conditions per place. [2023-08-26 19:10:46,756 INFO L140 encePairwiseOnDemand]: 415/445 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-26 19:10:46,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 246 flow [2023-08-26 19:10:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:10:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:10:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2023-08-26 19:10:46,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-08-26 19:10:46,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2023-08-26 19:10:46,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2023-08-26 19:10:46,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:46,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2023-08-26 19:10:46,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have 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:10:46,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:46,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:46,791 INFO L175 Difference]: Start difference. First operand has 70 places, 92 transitions, 192 flow. Second operand 3 states and 642 transitions. [2023-08-26 19:10:46,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 246 flow [2023-08-26 19:10:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:10:46,796 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 150 flow [2023-08-26 19:10:46,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-26 19:10:46,800 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2023-08-26 19:10:46,800 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 150 flow [2023-08-26 19:10:46,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:10:46,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:46,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 19:10:46,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:10:46,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:46,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 28310633, now seen corresponding path program 1 times [2023-08-26 19:10:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665446807] [2023-08-26 19:10:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:46,904 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:10:46,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:46,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665446807] [2023-08-26 19:10:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665446807] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:10:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150808817] [2023-08-26 19:10:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:46,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:46,909 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:10:46,942 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:10:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:47,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:10:47,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:10:47,064 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:10:47,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:10:47,083 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:10:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150808817] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:10:47,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:10:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:10:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795409361] [2023-08-26 19:10:47,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:10:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:10:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:10:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:10:47,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 445 [2023-08-26 19:10:47,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 188.28571428571428) internal successors, (1318), 7 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have 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:10:47,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:47,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 445 [2023-08-26 19:10:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:47,359 INFO L124 PetriNetUnfolderBase]: 563/1294 cut-off events. [2023-08-26 19:10:47,360 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:10:47,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 1294 events. 563/1294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8514 event pairs, 513 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 2407. Up to 1105 conditions per place. [2023-08-26 19:10:47,365 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-26 19:10:47,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 274 flow [2023-08-26 19:10:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:10:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:10:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1181 transitions. [2023-08-26 19:10:47,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44232209737827716 [2023-08-26 19:10:47,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1181 transitions. [2023-08-26 19:10:47,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1181 transitions. [2023-08-26 19:10:47,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:47,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1181 transitions. [2023-08-26 19:10:47,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.83333333333334) internal successors, (1181), 6 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have 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:10:47,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have 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:10:47,377 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have 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:10:47,377 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 150 flow. Second operand 6 states and 1181 transitions. [2023-08-26 19:10:47,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 274 flow [2023-08-26 19:10:47,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:10:47,380 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 182 flow [2023-08-26 19:10:47,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-26 19:10:47,381 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2023-08-26 19:10:47,381 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 182 flow [2023-08-26 19:10:47,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 188.28571428571428) internal successors, (1318), 7 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have 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:10:47,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:47,382 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:10:47,391 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:10:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:47,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:47,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1551575821, now seen corresponding path program 2 times [2023-08-26 19:10:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47469562] [2023-08-26 19:10:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 19:10:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47469562] [2023-08-26 19:10:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47469562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:10:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108137106] [2023-08-26 19:10:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:47,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:10:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:10:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:10:47,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 445 [2023-08-26 19:10:47,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:10:47,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:47,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 445 [2023-08-26 19:10:47,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:47,919 INFO L124 PetriNetUnfolderBase]: 648/1375 cut-off events. [2023-08-26 19:10:47,920 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 19:10:47,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1375 events. 648/1375 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8612 event pairs, 575 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 2651. Up to 1226 conditions per place. [2023-08-26 19:10:47,927 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 77 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2023-08-26 19:10:47,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 388 flow [2023-08-26 19:10:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:10:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:10:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2023-08-26 19:10:47,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41947565543071164 [2023-08-26 19:10:47,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2023-08-26 19:10:47,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2023-08-26 19:10:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:47,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2023-08-26 19:10:47,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:10:47,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:47,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:47,934 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 182 flow. Second operand 3 states and 560 transitions. [2023-08-26 19:10:47,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 388 flow [2023-08-26 19:10:47,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:10:47,937 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 168 flow [2023-08-26 19:10:47,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2023-08-26 19:10:47,938 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2023-08-26 19:10:47,938 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 168 flow [2023-08-26 19:10:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:10:47,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:47,939 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:10:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:10:47,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:47,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1551575820, now seen corresponding path program 1 times [2023-08-26 19:10:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:47,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836224931] [2023-08-26 19:10:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:10:48,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836224931] [2023-08-26 19:10:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836224931] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:10:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296349697] [2023-08-26 19:10:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:48,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:48,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:48,021 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:10:48,039 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:10:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:48,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:10:48,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:10:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:10:48,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:10:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:10:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296349697] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:10:48,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:10:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 19:10:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146587170] [2023-08-26 19:10:48,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:10:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 19:10:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 19:10:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 19:10:48,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 445 [2023-08-26 19:10:48,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 168 flow. Second operand has 13 states, 13 states have (on average 188.15384615384616) internal successors, (2446), 13 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have 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:10:48,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:48,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 445 [2023-08-26 19:10:48,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:48,326 INFO L124 PetriNetUnfolderBase]: 523/1210 cut-off events. [2023-08-26 19:10:48,326 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-08-26 19:10:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 1210 events. 523/1210 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7821 event pairs, 475 based on Foata normal form. 6/841 useless extension candidates. Maximal degree in co-relation 2250. Up to 1025 conditions per place. [2023-08-26 19:10:48,333 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 49 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2023-08-26 19:10:48,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 324 flow [2023-08-26 19:10:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:10:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:10:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2310 transitions. [2023-08-26 19:10:48,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43258426966292135 [2023-08-26 19:10:48,340 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2310 transitions. [2023-08-26 19:10:48,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2310 transitions. [2023-08-26 19:10:48,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:48,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2310 transitions. [2023-08-26 19:10:48,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 192.5) internal successors, (2310), 12 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have 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:10:48,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 445.0) internal successors, (5785), 13 states have internal predecessors, (5785), 0 states have call successors, (0), 0 states have 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:10:48,357 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 445.0) internal successors, (5785), 13 states have internal predecessors, (5785), 0 states have call successors, (0), 0 states have 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:10:48,357 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 168 flow. Second operand 12 states and 2310 transitions. [2023-08-26 19:10:48,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 324 flow [2023-08-26 19:10:48,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:10:48,364 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 248 flow [2023-08-26 19:10:48,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2023-08-26 19:10:48,368 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2023-08-26 19:10:48,368 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 248 flow [2023-08-26 19:10:48,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 188.15384615384616) internal successors, (2446), 13 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have 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:10:48,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:48,369 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-26 19:10:48,381 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:10:48,574 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,SelfDestructingSolverStorable3 [2023-08-26 19:10:48,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:48,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 934440332, now seen corresponding path program 2 times [2023-08-26 19:10:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280908751] [2023-08-26 19:10:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280908751] [2023-08-26 19:10:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280908751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:48,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:48,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:10:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522724709] [2023-08-26 19:10:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:48,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:10:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:48,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:10:48,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:10:48,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 445 [2023-08-26 19:10:48,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:10:48,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:48,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 445 [2023-08-26 19:10:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:48,964 INFO L124 PetriNetUnfolderBase]: 543/1217 cut-off events. [2023-08-26 19:10:48,964 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 19:10:48,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 1217 events. 543/1217 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8125 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 2333. Up to 1084 conditions per place. [2023-08-26 19:10:48,971 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 81 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-26 19:10:48,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 94 transitions, 456 flow [2023-08-26 19:10:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:10:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:10:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2023-08-26 19:10:48,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2023-08-26 19:10:48,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2023-08-26 19:10:48,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2023-08-26 19:10:48,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:48,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2023-08-26 19:10:48,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have 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:10:48,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have 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:10:48,977 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 248 flow. Second operand 3 states and 540 transitions. [2023-08-26 19:10:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 94 transitions, 456 flow [2023-08-26 19:10:48,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 408 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 19:10:48,981 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 210 flow [2023-08-26 19:10:48,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-08-26 19:10:48,981 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2023-08-26 19:10:48,982 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 210 flow [2023-08-26 19:10:48,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:10:48,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:48,982 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-26 19:10:48,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:10:48,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:48,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2065438184, now seen corresponding path program 1 times [2023-08-26 19:10:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27565242] [2023-08-26 19:10:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27565242] [2023-08-26 19:10:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27565242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:10:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320527898] [2023-08-26 19:10:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:49,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:49,117 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:10:49,145 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:10:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:49,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 19:10:49,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:10:49,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 19:10:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:49,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:10:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320527898] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:10:49,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:10:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-26 19:10:49,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263095956] [2023-08-26 19:10:49,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:10:49,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 19:10:49,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 19:10:49,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:10:49,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 445 [2023-08-26 19:10:49,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 210 flow. Second operand has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have 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:10:49,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:49,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 445 [2023-08-26 19:10:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:49,452 INFO L124 PetriNetUnfolderBase]: 44/136 cut-off events. [2023-08-26 19:10:49,452 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2023-08-26 19:10:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 136 events. 44/136 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 435 event pairs, 16 based on Foata normal form. 21/139 useless extension candidates. Maximal degree in co-relation 289. Up to 82 conditions per place. [2023-08-26 19:10:49,453 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 45 selfloop transitions, 2 changer transitions 11/64 dead transitions. [2023-08-26 19:10:49,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 299 flow [2023-08-26 19:10:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:10:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:10:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2023-08-26 19:10:49,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758426966292135 [2023-08-26 19:10:49,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2023-08-26 19:10:49,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2023-08-26 19:10:49,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:49,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2023-08-26 19:10:49,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 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:10:49,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:49,460 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:49,460 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 210 flow. Second operand 4 states and 669 transitions. [2023-08-26 19:10:49,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 299 flow [2023-08-26 19:10:49,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:10:49,462 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 129 flow [2023-08-26 19:10:49,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-26 19:10:49,463 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2023-08-26 19:10:49,463 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 129 flow [2023-08-26 19:10:49,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have 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:10:49,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:49,464 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:10:49,472 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:10:49,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:49,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:49,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 395970435, now seen corresponding path program 1 times [2023-08-26 19:10:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:49,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511901369] [2023-08-26 19:10:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511901369] [2023-08-26 19:10:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511901369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:10:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807451678] [2023-08-26 19:10:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:49,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:10:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:10:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:10:49,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 445 [2023-08-26 19:10:49,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have 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:10:49,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:49,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 445 [2023-08-26 19:10:49,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:49,953 INFO L124 PetriNetUnfolderBase]: 21/74 cut-off events. [2023-08-26 19:10:49,954 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-26 19:10:49,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 74 events. 21/74 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 0 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 142. Up to 50 conditions per place. [2023-08-26 19:10:49,954 INFO L140 encePairwiseOnDemand]: 435/445 looper letters, 19 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2023-08-26 19:10:49,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 31 transitions, 175 flow [2023-08-26 19:10:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:10:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:10:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-08-26 19:10:49,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33370786516853934 [2023-08-26 19:10:49,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-08-26 19:10:49,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-08-26 19:10:49,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:49,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-08-26 19:10:49,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:10:49,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:49,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:49,961 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 129 flow. Second operand 4 states and 594 transitions. [2023-08-26 19:10:49,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 31 transitions, 175 flow [2023-08-26 19:10:49,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:10:49,964 INFO L231 Difference]: Finished difference. Result has 46 places, 21 transitions, 98 flow [2023-08-26 19:10:49,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=21} [2023-08-26 19:10:49,965 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2023-08-26 19:10:49,965 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 21 transitions, 98 flow [2023-08-26 19:10:49,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have 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:10:49,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:49,965 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:10:49,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:10:49,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:10:49,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -609823291, now seen corresponding path program 1 times [2023-08-26 19:10:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925784681] [2023-08-26 19:10:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:10:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925784681] [2023-08-26 19:10:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925784681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:10:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721568357] [2023-08-26 19:10:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:10:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:10:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:10:50,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 445 [2023-08-26 19:10:50,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 21 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:10:50,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:50,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 445 [2023-08-26 19:10:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:50,166 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2023-08-26 19:10:50,166 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-26 19:10:50,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 32 events. 5/32 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 4 based on Foata normal form. 3/35 useless extension candidates. Maximal degree in co-relation 59. Up to 15 conditions per place. [2023-08-26 19:10:50,167 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2023-08-26 19:10:50,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 20 transitions, 132 flow [2023-08-26 19:10:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:10:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:10:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 19:10:50,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3039325842696629 [2023-08-26 19:10:50,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 19:10:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 19:10:50,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:50,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 19:10:50,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:10:50,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:50,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have 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:10:50,173 INFO L175 Difference]: Start difference. First operand has 46 places, 21 transitions, 98 flow. Second operand 4 states and 541 transitions. [2023-08-26 19:10:50,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 20 transitions, 132 flow [2023-08-26 19:10:50,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 20 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:10:50,174 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2023-08-26 19:10:50,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2023-08-26 19:10:50,175 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -32 predicate places. [2023-08-26 19:10:50,175 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2023-08-26 19:10:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:10:50,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2023-08-26 19:10:50,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-08-26 19:10:50,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (24 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-08-26 19:10:50,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-08-26 19:10:50,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (7 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (3 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-08-26 19:10:50,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 37 remaining) [2023-08-26 19:10:50,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:10:50,182 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-08-26 19:10:50,183 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 19:10:50,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:50,210 INFO L124 PetriNetUnfolderBase]: 48/318 cut-off events. [2023-08-26 19:10:50,210 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 19:10:50,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 318 events. 48/318 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1193 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 180. Up to 8 conditions per place. [2023-08-26 19:10:50,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 228 transitions, 464 flow [2023-08-26 19:10:50,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 223 transitions, 451 flow [2023-08-26 19:10:50,214 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:10:50,214 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 223 transitions, 451 flow [2023-08-26 19:10:50,214 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 223 transitions, 451 flow [2023-08-26 19:10:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 223 transitions, 451 flow [2023-08-26 19:10:50,234 INFO L124 PetriNetUnfolderBase]: 47/313 cut-off events. [2023-08-26 19:10:50,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:50,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 313 events. 47/313 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1156 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 180. Up to 8 conditions per place. [2023-08-26 19:10:50,241 INFO L119 LiptonReduction]: Number of co-enabled transitions 16320 [2023-08-26 19:10:53,540 INFO L134 LiptonReduction]: Checked pairs total: 30163 [2023-08-26 19:10:53,540 INFO L136 LiptonReduction]: Total number of compositions: 214 [2023-08-26 19:10:53,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 19:10:53,543 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;@38bddf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:10:53,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 19:10:53,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:10:53,548 INFO L124 PetriNetUnfolderBase]: 12/57 cut-off events. [2023-08-26 19:10:53,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:53,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:53,548 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-26 19:10:53,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:10:53,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1054683533, now seen corresponding path program 1 times [2023-08-26 19:10:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077716358] [2023-08-26 19:10:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077716358] [2023-08-26 19:10:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077716358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:53,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:10:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187762117] [2023-08-26 19:10:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:10:53,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:53,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:10:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:10:53,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-08-26 19:10:53,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 91 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have 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:10:53,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:53,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-08-26 19:10:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:53,705 INFO L124 PetriNetUnfolderBase]: 542/1246 cut-off events. [2023-08-26 19:10:53,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:53,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 1246 events. 542/1246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8118 event pairs, 494 based on Foata normal form. 96/917 useless extension candidates. Maximal degree in co-relation 2243. Up to 1063 conditions per place. [2023-08-26 19:10:53,708 INFO L140 encePairwiseOnDemand]: 410/442 looper letters, 27 selfloop transitions, 2 changer transitions 26/63 dead transitions. [2023-08-26 19:10:53,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 231 flow [2023-08-26 19:10:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:10:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:10:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-08-26 19:10:53,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48340874811463047 [2023-08-26 19:10:53,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-08-26 19:10:53,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-08-26 19:10:53,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:53,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-08-26 19:10:53,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have 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:10:53,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:10:53,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:10:53,715 INFO L175 Difference]: Start difference. First operand has 69 places, 91 transitions, 187 flow. Second operand 3 states and 641 transitions. [2023-08-26 19:10:53,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 231 flow [2023-08-26 19:10:53,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 231 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:10:53,717 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 89 flow [2023-08-26 19:10:53,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2023-08-26 19:10:53,718 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2023-08-26 19:10:53,718 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 89 flow [2023-08-26 19:10:53,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have 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:10:53,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:53,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:10:53,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:10:53,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:10:53,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1716647263, now seen corresponding path program 1 times [2023-08-26 19:10:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951027421] [2023-08-26 19:10:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951027421] [2023-08-26 19:10:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951027421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:10:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517324652] [2023-08-26 19:10:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:53,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:53,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:53,783 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:10:53,813 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:10:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:53,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:10:53,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:10:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:53,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:10:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517324652] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:10:53,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:10:53,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:10:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243603384] [2023-08-26 19:10:53,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:10:53,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:10:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:10:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:10:53,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-08-26 19:10:53,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have 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:10:53,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:53,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-08-26 19:10:53,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:53,955 INFO L124 PetriNetUnfolderBase]: 102/269 cut-off events. [2023-08-26 19:10:53,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:53,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 269 events. 102/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1146 event pairs, 95 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 499. Up to 223 conditions per place. [2023-08-26 19:10:53,956 INFO L140 encePairwiseOnDemand]: 439/442 looper letters, 27 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-26 19:10:53,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 165 flow [2023-08-26 19:10:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:10:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:10:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1157 transitions. [2023-08-26 19:10:53,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2023-08-26 19:10:53,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1157 transitions. [2023-08-26 19:10:53,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1157 transitions. [2023-08-26 19:10:53,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:53,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1157 transitions. [2023-08-26 19:10:53,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have 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:10:53,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:10:53,968 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:10:53,968 INFO L175 Difference]: Start difference. First operand has 65 places, 37 transitions, 89 flow. Second operand 6 states and 1157 transitions. [2023-08-26 19:10:53,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 165 flow [2023-08-26 19:10:53,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 161 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:10:53,969 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 121 flow [2023-08-26 19:10:53,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-26 19:10:53,970 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-26 19:10:53,970 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 121 flow [2023-08-26 19:10:53,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have 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:10:53,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:53,971 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-26 19:10:53,979 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:10:54,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:54,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:10:54,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -673671667, now seen corresponding path program 2 times [2023-08-26 19:10:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:54,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418216709] [2023-08-26 19:10:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418216709] [2023-08-26 19:10:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418216709] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:10:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261094239] [2023-08-26 19:10:54,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:10:54,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:10:54,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:10:54,242 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:10:54,245 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:10:54,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:10:54,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:10:54,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:10:54,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:10:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:54,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:10:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:10:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261094239] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:10:54,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:10:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 19:10:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370362311] [2023-08-26 19:10:54,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:10:54,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 19:10:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 19:10:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 19:10:54,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-08-26 19:10:54,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 121 flow. Second operand has 13 states, 13 states have (on average 188.30769230769232) internal successors, (2448), 13 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:10:54,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:54,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-08-26 19:10:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:54,483 INFO L124 PetriNetUnfolderBase]: 102/275 cut-off events. [2023-08-26 19:10:54,483 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 19:10:54,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 275 events. 102/275 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1146 event pairs, 95 based on Foata normal form. 6/176 useless extension candidates. Maximal degree in co-relation 490. Up to 223 conditions per place. [2023-08-26 19:10:54,484 INFO L140 encePairwiseOnDemand]: 439/442 looper letters, 27 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-26 19:10:54,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 233 flow [2023-08-26 19:10:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:10:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:10:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2288 transitions. [2023-08-26 19:10:54,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2023-08-26 19:10:54,490 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2288 transitions. [2023-08-26 19:10:54,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2288 transitions. [2023-08-26 19:10:54,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:10:54,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2288 transitions. [2023-08-26 19:10:54,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 190.66666666666666) internal successors, (2288), 12 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have 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:10:54,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 442.0) internal successors, (5746), 13 states have internal predecessors, (5746), 0 states have call successors, (0), 0 states have 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:10:54,503 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 442.0) internal successors, (5746), 13 states have internal predecessors, (5746), 0 states have call successors, (0), 0 states have 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:10:54,504 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 121 flow. Second operand 12 states and 2288 transitions. [2023-08-26 19:10:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 233 flow [2023-08-26 19:10:54,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 219 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:10:54,505 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 191 flow [2023-08-26 19:10:54,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-26 19:10:54,506 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2023-08-26 19:10:54,506 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 191 flow [2023-08-26 19:10:54,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 188.30769230769232) internal successors, (2448), 13 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:10:54,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:54,507 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-26 19:10:54,515 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:10:54,715 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,SelfDestructingSolverStorable10 [2023-08-26 19:10:54,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:10:54,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2010647347, now seen corresponding path program 3 times [2023-08-26 19:10:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732425877] [2023-08-26 19:10:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:10:54,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 19:10:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:10:54,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 19:10:54,776 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 19:10:54,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 19:10:54,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 19:10:54,776 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 19:10:54,777 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 19:10:54,778 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 19:10:54,778 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 19:10:54,819 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 19:10:54,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,873 INFO L124 PetriNetUnfolderBase]: 80/522 cut-off events. [2023-08-26 19:10:54,873 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:10:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 522 events. 80/522 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2395 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 320. Up to 12 conditions per place. [2023-08-26 19:10:54,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:10:54,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:10:54,939 INFO L124 PetriNetUnfolderBase]: 80/522 cut-off events. [2023-08-26 19:10:54,939 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:10:54,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 522 events. 80/522 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2395 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 320. Up to 12 conditions per place. [2023-08-26 19:10:54,965 INFO L119 LiptonReduction]: Number of co-enabled transitions 48960 [2023-08-26 19:10:59,018 INFO L134 LiptonReduction]: Checked pairs total: 88602 [2023-08-26 19:10:59,019 INFO L136 LiptonReduction]: Total number of compositions: 292 [2023-08-26 19:10:59,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:10:59,020 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;@38bddf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:10:59,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2023-08-26 19:10:59,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:10:59,021 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-08-26 19:10:59,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:10:59,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:10:59,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:10:59,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:10:59,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:10:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1812240, now seen corresponding path program 1 times [2023-08-26 19:10:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:10:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268209719] [2023-08-26 19:10:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:10:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:10:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:10:59,037 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:10:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:10:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268209719] [2023-08-26 19:10:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268209719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:10:59,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:10:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:10:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163560715] [2023-08-26 19:10:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:10:59,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:10:59,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:10:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:10:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:10:59,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 607 [2023-08-26 19:10:59,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 134 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:10:59,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:10:59,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 607 [2023-08-26 19:10:59,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:02,007 INFO L124 PetriNetUnfolderBase]: 22825/38051 cut-off events. [2023-08-26 19:11:02,007 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-26 19:11:02,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71674 conditions, 38051 events. 22825/38051 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 320771 event pairs, 21546 based on Foata normal form. 3152/29199 useless extension candidates. Maximal degree in co-relation 30523. Up to 33499 conditions per place. [2023-08-26 19:11:02,325 INFO L140 encePairwiseOnDemand]: 565/607 looper letters, 72 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-26 19:11:02,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 358 flow [2023-08-26 19:11:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:11:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:11:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2023-08-26 19:11:02,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876441515650741 [2023-08-26 19:11:02,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 888 transitions. [2023-08-26 19:11:02,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 888 transitions. [2023-08-26 19:11:02,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:02,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 888 transitions. [2023-08-26 19:11:02,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have 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:11:02,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:02,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:02,334 INFO L175 Difference]: Start difference. First operand has 102 places, 134 transitions, 286 flow. Second operand 3 states and 888 transitions. [2023-08-26 19:11:02,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 358 flow [2023-08-26 19:11:02,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:11:02,337 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 220 flow [2023-08-26 19:11:02,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-26 19:11:02,338 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -5 predicate places. [2023-08-26 19:11:02,338 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 220 flow [2023-08-26 19:11:02,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:11:02,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:02,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 19:11:02,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 19:11:02,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:02,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash 56140452, now seen corresponding path program 1 times [2023-08-26 19:11:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099792977] [2023-08-26 19:11:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:02,360 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:11:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099792977] [2023-08-26 19:11:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099792977] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206182856] [2023-08-26 19:11:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:02,362 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:11:02,391 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:11:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:02,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:11:02,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:02,448 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:11:02,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:02,458 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:11:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206182856] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:11:02,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:11:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:11:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178525002] [2023-08-26 19:11:02,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:11:02,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:11:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:11:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:11:02,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 607 [2023-08-26 19:11:02,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 259.2857142857143) internal successors, (1815), 7 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have 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:11:02,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:02,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 607 [2023-08-26 19:11:02,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:04,795 INFO L124 PetriNetUnfolderBase]: 22825/38054 cut-off events. [2023-08-26 19:11:04,795 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-26 19:11:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71690 conditions, 38054 events. 22825/38054 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 320745 event pairs, 21546 based on Foata normal form. 0/26050 useless extension candidates. Maximal degree in co-relation 71677. Up to 33499 conditions per place. [2023-08-26 19:11:05,132 INFO L140 encePairwiseOnDemand]: 604/607 looper letters, 72 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2023-08-26 19:11:05,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 386 flow [2023-08-26 19:11:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:11:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:11:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1628 transitions. [2023-08-26 19:11:05,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44700713893465127 [2023-08-26 19:11:05,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1628 transitions. [2023-08-26 19:11:05,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1628 transitions. [2023-08-26 19:11:05,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:05,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1628 transitions. [2023-08-26 19:11:05,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 271.3333333333333) internal successors, (1628), 6 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have 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:11:05,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 607.0) internal successors, (4249), 7 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have 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:11:05,146 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 607.0) internal successors, (4249), 7 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have 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:11:05,146 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 220 flow. Second operand 6 states and 1628 transitions. [2023-08-26 19:11:05,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 386 flow [2023-08-26 19:11:05,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 382 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:11:05,149 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 252 flow [2023-08-26 19:11:05,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2023-08-26 19:11:05,151 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-08-26 19:11:05,151 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 252 flow [2023-08-26 19:11:05,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 259.2857142857143) internal successors, (1815), 7 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have 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:11:05,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:05,152 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:11:05,160 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:11:05,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:05,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:05,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1699243087, now seen corresponding path program 2 times [2023-08-26 19:11:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310295317] [2023-08-26 19:11:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:11:05,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:05,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310295317] [2023-08-26 19:11:05,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310295317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:05,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578045872] [2023-08-26 19:11:05,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:11:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:05,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:05,427 INFO L229 MonitoredProcess]: Starting monitored process 8 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:11:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 19:11:05,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 19:11:05,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:11:05,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:11:05,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:05,512 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 19:11:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 19:11:05,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:11:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578045872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:11:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-26 19:11:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226798756] [2023-08-26 19:11:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:05,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:11:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:11:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:11:05,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 607 [2023-08-26 19:11:05,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have 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:11:05,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:05,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 607 [2023-08-26 19:11:05,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:07,852 INFO L124 PetriNetUnfolderBase]: 24498/40388 cut-off events. [2023-08-26 19:11:07,852 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2023-08-26 19:11:07,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76998 conditions, 40388 events. 24498/40388 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 335167 event pairs, 11286 based on Foata normal form. 0/28212 useless extension candidates. Maximal degree in co-relation 76963. Up to 36410 conditions per place. [2023-08-26 19:11:08,076 INFO L140 encePairwiseOnDemand]: 603/607 looper letters, 100 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2023-08-26 19:11:08,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 502 flow [2023-08-26 19:11:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:11:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:11:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-26 19:11:08,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41076331685886874 [2023-08-26 19:11:08,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-26 19:11:08,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-26 19:11:08,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:08,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-26 19:11:08,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 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:11:08,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:08,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:08,084 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 252 flow. Second operand 3 states and 748 transitions. [2023-08-26 19:11:08,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 502 flow [2023-08-26 19:11:08,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 122 transitions, 488 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:11:08,087 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 252 flow [2023-08-26 19:11:08,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-08-26 19:11:08,088 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 4 predicate places. [2023-08-26 19:11:08,088 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 252 flow [2023-08-26 19:11:08,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have 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:11:08,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:08,088 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:11:08,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 19:11:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:08,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:08,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1699243088, now seen corresponding path program 1 times [2023-08-26 19:11:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709401623] [2023-08-26 19:11:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 19:11:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709401623] [2023-08-26 19:11:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709401623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:08,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:11:08,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:11:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973084675] [2023-08-26 19:11:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:08,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:11:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:08,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:11:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:11:08,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 607 [2023-08-26 19:11:08,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 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:11:08,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:08,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 607 [2023-08-26 19:11:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:11,434 INFO L124 PetriNetUnfolderBase]: 32924/50770 cut-off events. [2023-08-26 19:11:11,434 INFO L125 PetriNetUnfolderBase]: For 1417/1417 co-relation queries the response was YES. [2023-08-26 19:11:11,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101161 conditions, 50770 events. 32924/50770 cut-off events. For 1417/1417 co-relation queries the response was YES. Maximal size of possible extension queue 1881. Compared 392747 event pairs, 30067 based on Foata normal form. 0/32002 useless extension candidates. Maximal degree in co-relation 101131. Up to 46470 conditions per place. [2023-08-26 19:11:11,698 INFO L140 encePairwiseOnDemand]: 603/607 looper letters, 131 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2023-08-26 19:11:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 608 flow [2023-08-26 19:11:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:11:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:11:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2023-08-26 19:11:11,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354750137287205 [2023-08-26 19:11:11,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2023-08-26 19:11:11,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2023-08-26 19:11:11,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:11,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2023-08-26 19:11:11,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have 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:11:11,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:11,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 607.0) internal successors, (2428), 4 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:11:11,706 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 252 flow. Second operand 3 states and 793 transitions. [2023-08-26 19:11:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 608 flow [2023-08-26 19:11:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:11:11,710 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 250 flow [2023-08-26 19:11:11,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2023-08-26 19:11:11,711 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2023-08-26 19:11:11,711 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 250 flow [2023-08-26 19:11:11,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 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:11:11,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:11,711 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 19:11:11,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:11,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 159936679, now seen corresponding path program 1 times [2023-08-26 19:11:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772174938] [2023-08-26 19:11:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:11:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772174938] [2023-08-26 19:11:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772174938] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167046246] [2023-08-26 19:11:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:11,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:11,793 INFO L229 MonitoredProcess]: Starting monitored process 9 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:11:11,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 19:11:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:11,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:11:11,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:11:11,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:11:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167046246] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:11:11,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:11:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 19:11:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785880684] [2023-08-26 19:11:11,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:11:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 19:11:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 19:11:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 19:11:11,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 607 [2023-08-26 19:11:11,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 250 flow. Second operand has 13 states, 13 states have (on average 259.46153846153845) internal successors, (3373), 13 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have 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:11:11,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:11,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 607 [2023-08-26 19:11:11,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:14,420 INFO L124 PetriNetUnfolderBase]: 21275/34941 cut-off events. [2023-08-26 19:11:14,420 INFO L125 PetriNetUnfolderBase]: For 1244/1244 co-relation queries the response was YES. [2023-08-26 19:11:14,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67847 conditions, 34941 events. 21275/34941 cut-off events. For 1244/1244 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 287163 event pairs, 19969 based on Foata normal form. 6/25299 useless extension candidates. Maximal degree in co-relation 67793. Up to 31040 conditions per place. [2023-08-26 19:11:14,596 INFO L140 encePairwiseOnDemand]: 604/607 looper letters, 71 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2023-08-26 19:11:14,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 450 flow [2023-08-26 19:11:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:11:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:11:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3183 transitions. [2023-08-26 19:11:14,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369851729818781 [2023-08-26 19:11:14,604 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3183 transitions. [2023-08-26 19:11:14,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3183 transitions. [2023-08-26 19:11:14,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:14,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3183 transitions. [2023-08-26 19:11:14,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 265.25) internal successors, (3183), 12 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have 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:11:14,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 607.0) internal successors, (7891), 13 states have internal predecessors, (7891), 0 states have call successors, (0), 0 states have 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:11:14,619 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 607.0) internal successors, (7891), 13 states have internal predecessors, (7891), 0 states have call successors, (0), 0 states have 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:11:14,619 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 250 flow. Second operand 12 states and 3183 transitions. [2023-08-26 19:11:14,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 450 flow [2023-08-26 19:11:14,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 104 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:11:14,646 INFO L231 Difference]: Finished difference. Result has 120 places, 104 transitions, 330 flow [2023-08-26 19:11:14,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=330, PETRI_PLACES=120, PETRI_TRANSITIONS=104} [2023-08-26 19:11:14,647 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2023-08-26 19:11:14,647 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 330 flow [2023-08-26 19:11:14,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 259.46153846153845) internal successors, (3373), 13 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have 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:11:14,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:14,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 19:11:14,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 19:11:14,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:14,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1974235271, now seen corresponding path program 2 times [2023-08-26 19:11:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088800684] [2023-08-26 19:11:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088800684] [2023-08-26 19:11:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088800684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:11:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:11:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213199525] [2023-08-26 19:11:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:15,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:11:15,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:11:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:11:15,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 607 [2023-08-26 19:11:15,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:11:15,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:15,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 607 [2023-08-26 19:11:15,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:16,946 INFO L124 PetriNetUnfolderBase]: 15329/24144 cut-off events. [2023-08-26 19:11:16,946 INFO L125 PetriNetUnfolderBase]: For 837/837 co-relation queries the response was YES. [2023-08-26 19:11:17,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48439 conditions, 24144 events. 15329/24144 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 186496 event pairs, 396 based on Foata normal form. 0/19446 useless extension candidates. Maximal degree in co-relation 48361. Up to 21241 conditions per place. [2023-08-26 19:11:17,065 INFO L140 encePairwiseOnDemand]: 587/607 looper letters, 167 selfloop transitions, 6 changer transitions 0/185 dead transitions. [2023-08-26 19:11:17,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 185 transitions, 854 flow [2023-08-26 19:11:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:11:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:11:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1373 transitions. [2023-08-26 19:11:17,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3769906644700714 [2023-08-26 19:11:17,068 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1373 transitions. [2023-08-26 19:11:17,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1373 transitions. [2023-08-26 19:11:17,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:17,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1373 transitions. [2023-08-26 19:11:17,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.83333333333334) internal successors, (1373), 6 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have 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:11:17,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 607.0) internal successors, (4249), 7 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have 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:11:17,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 607.0) internal successors, (4249), 7 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have 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:11:17,077 INFO L175 Difference]: Start difference. First operand has 120 places, 104 transitions, 330 flow. Second operand 6 states and 1373 transitions. [2023-08-26 19:11:17,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 185 transitions, 854 flow [2023-08-26 19:11:17,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 185 transitions, 806 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 19:11:17,081 INFO L231 Difference]: Finished difference. Result has 104 places, 90 transitions, 266 flow [2023-08-26 19:11:17,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=104, PETRI_TRANSITIONS=90} [2023-08-26 19:11:17,081 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-08-26 19:11:17,081 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 266 flow [2023-08-26 19:11:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:11:17,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:17,082 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:17,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 19:11:17,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:17,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1973658177, now seen corresponding path program 1 times [2023-08-26 19:11:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193732252] [2023-08-26 19:11:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193732252] [2023-08-26 19:11:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193732252] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227170981] [2023-08-26 19:11:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:17,193 INFO L229 MonitoredProcess]: Starting monitored process 10 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:11:17,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 19:11:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:17,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 19:11:17,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:17,303 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 19:11:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:17,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227170981] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:11:17,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:11:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-26 19:11:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458800917] [2023-08-26 19:11:17,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:11:17,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 19:11:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 19:11:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:11:17,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 607 [2023-08-26 19:11:17,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 218.125) internal successors, (1745), 8 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have 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:11:17,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:17,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 607 [2023-08-26 19:11:17,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:17,784 INFO L124 PetriNetUnfolderBase]: 1575/2984 cut-off events. [2023-08-26 19:11:17,784 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-08-26 19:11:17,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6716 conditions, 2984 events. 1575/2984 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19102 event pairs, 0 based on Foata normal form. 340/2999 useless extension candidates. Maximal degree in co-relation 6661. Up to 1866 conditions per place. [2023-08-26 19:11:17,797 INFO L140 encePairwiseOnDemand]: 603/607 looper letters, 101 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2023-08-26 19:11:17,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 504 flow [2023-08-26 19:11:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:11:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:11:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2023-08-26 19:11:17,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38813838550247115 [2023-08-26 19:11:17,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2023-08-26 19:11:17,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2023-08-26 19:11:17,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:17,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2023-08-26 19:11:17,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:11:17,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 607.0) internal successors, (3642), 6 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have 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:11:17,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 607.0) internal successors, (3642), 6 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have 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:11:17,808 INFO L175 Difference]: Start difference. First operand has 104 places, 90 transitions, 266 flow. Second operand 5 states and 1178 transitions. [2023-08-26 19:11:17,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 504 flow [2023-08-26 19:11:17,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 495 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 19:11:17,812 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 187 flow [2023-08-26 19:11:17,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2023-08-26 19:11:17,813 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -24 predicate places. [2023-08-26 19:11:17,813 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 187 flow [2023-08-26 19:11:17,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 218.125) internal successors, (1745), 8 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have 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:11:17,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:17,813 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:17,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 19:11:18,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:18,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:18,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1071750694, now seen corresponding path program 1 times [2023-08-26 19:11:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334972215] [2023-08-26 19:11:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:18,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:18,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334972215] [2023-08-26 19:11:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334972215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:18,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:11:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:11:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758583379] [2023-08-26 19:11:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:18,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:11:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:11:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:11:18,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 607 [2023-08-26 19:11:18,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:11:18,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:18,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 607 [2023-08-26 19:11:18,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:18,727 INFO L124 PetriNetUnfolderBase]: 1600/2763 cut-off events. [2023-08-26 19:11:18,727 INFO L125 PetriNetUnfolderBase]: For 1133/1133 co-relation queries the response was YES. [2023-08-26 19:11:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6208 conditions, 2763 events. 1600/2763 cut-off events. For 1133/1133 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15934 event pairs, 659 based on Foata normal form. 0/2498 useless extension candidates. Maximal degree in co-relation 6154. Up to 1718 conditions per place. [2023-08-26 19:11:18,735 INFO L140 encePairwiseOnDemand]: 601/607 looper letters, 68 selfloop transitions, 4 changer transitions 5/84 dead transitions. [2023-08-26 19:11:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 84 transitions, 405 flow [2023-08-26 19:11:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:11:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:11:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2023-08-26 19:11:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3373146622734761 [2023-08-26 19:11:18,738 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 819 transitions. [2023-08-26 19:11:18,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 819 transitions. [2023-08-26 19:11:18,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:18,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 819 transitions. [2023-08-26 19:11:18,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.75) internal successors, (819), 4 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have 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:11:18,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:18,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:18,743 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 187 flow. Second operand 4 states and 819 transitions. [2023-08-26 19:11:18,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 84 transitions, 405 flow [2023-08-26 19:11:18,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 394 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 19:11:18,747 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 199 flow [2023-08-26 19:11:18,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2023-08-26 19:11:18,747 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -23 predicate places. [2023-08-26 19:11:18,747 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 199 flow [2023-08-26 19:11:18,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:11:18,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:18,748 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:18,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 19:11:18,748 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:18,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash -581970176, now seen corresponding path program 1 times [2023-08-26 19:11:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581139474] [2023-08-26 19:11:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:11:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581139474] [2023-08-26 19:11:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581139474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:11:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:11:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088237753] [2023-08-26 19:11:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:18,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:11:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:11:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:11:18,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 607 [2023-08-26 19:11:18,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have 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:11:18,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:18,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 607 [2023-08-26 19:11:18,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:19,203 INFO L124 PetriNetUnfolderBase]: 1118/2041 cut-off events. [2023-08-26 19:11:19,203 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2023-08-26 19:11:19,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 2041 events. 1118/2041 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11391 event pairs, 98 based on Foata normal form. 51/1998 useless extension candidates. Maximal degree in co-relation 4427. Up to 1670 conditions per place. [2023-08-26 19:11:19,212 INFO L140 encePairwiseOnDemand]: 602/607 looper letters, 58 selfloop transitions, 2 changer transitions 6/73 dead transitions. [2023-08-26 19:11:19,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 365 flow [2023-08-26 19:11:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:11:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:11:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 844 transitions. [2023-08-26 19:11:19,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34761120263591433 [2023-08-26 19:11:19,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 844 transitions. [2023-08-26 19:11:19,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 844 transitions. [2023-08-26 19:11:19,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:19,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 844 transitions. [2023-08-26 19:11:19,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have 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:11:19,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:19,219 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:19,219 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 199 flow. Second operand 4 states and 844 transitions. [2023-08-26 19:11:19,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 365 flow [2023-08-26 19:11:19,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:11:19,222 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 180 flow [2023-08-26 19:11:19,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2023-08-26 19:11:19,222 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -26 predicate places. [2023-08-26 19:11:19,222 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 180 flow [2023-08-26 19:11:19,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have 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:11:19,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:19,223 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:19,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 19:11:19,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:19,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1792541068, now seen corresponding path program 1 times [2023-08-26 19:11:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623474940] [2023-08-26 19:11:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:11:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623474940] [2023-08-26 19:11:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623474940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:11:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:11:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:11:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231146974] [2023-08-26 19:11:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:11:19,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:11:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:11:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:11:19,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 607 [2023-08-26 19:11:19,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have 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:11:19,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:19,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 607 [2023-08-26 19:11:19,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:19,510 INFO L124 PetriNetUnfolderBase]: 513/1008 cut-off events. [2023-08-26 19:11:19,510 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-08-26 19:11:19,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2332 conditions, 1008 events. 513/1008 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5128 event pairs, 193 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2277. Up to 568 conditions per place. [2023-08-26 19:11:19,514 INFO L140 encePairwiseOnDemand]: 594/607 looper letters, 45 selfloop transitions, 13 changer transitions 4/68 dead transitions. [2023-08-26 19:11:19,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 352 flow [2023-08-26 19:11:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:11:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:11:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2023-08-26 19:11:19,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32948929159802304 [2023-08-26 19:11:19,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 800 transitions. [2023-08-26 19:11:19,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 800 transitions. [2023-08-26 19:11:19,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:19,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 800 transitions. [2023-08-26 19:11:19,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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:11:19,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:19,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 607.0) internal successors, (3035), 5 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have 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:11:19,520 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 180 flow. Second operand 4 states and 800 transitions. [2023-08-26 19:11:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 352 flow [2023-08-26 19:11:19,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:11:19,522 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 223 flow [2023-08-26 19:11:19,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2023-08-26 19:11:19,523 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -25 predicate places. [2023-08-26 19:11:19,523 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 223 flow [2023-08-26 19:11:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have 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:11:19,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:19,523 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:19,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 19:11:19,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:19,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1647101910, now seen corresponding path program 1 times [2023-08-26 19:11:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247943032] [2023-08-26 19:11:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:11:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247943032] [2023-08-26 19:11:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247943032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115854] [2023-08-26 19:11:19,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:19,890 INFO L229 MonitoredProcess]: Starting monitored process 11 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:11:19,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 19:11:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:20,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:11:20,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:20,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:11:20,090 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:20,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:11:20,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:20,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:20,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:11:20,203 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:20,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:11:20,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:11:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:11:20,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:20,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-26 19:11:20,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-26 19:11:28,519 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_110| Int) (v_ArrVal_599 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_599) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_110| 28) |~#a~0.offset|)) 0)) is different from false [2023-08-26 19:11:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:11:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:11:28,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:11:28,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-26 19:11:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090891367] [2023-08-26 19:11:28,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:11:28,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 19:11:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 19:11:28,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=171, Unknown=3, NotChecked=28, Total=272 [2023-08-26 19:11:28,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 607 [2023-08-26 19:11:28,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 223 flow. Second operand has 17 states, 17 states have (on average 164.64705882352942) internal successors, (2799), 17 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have 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:11:28,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:28,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 607 [2023-08-26 19:11:28,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:29,138 INFO L124 PetriNetUnfolderBase]: 732/1423 cut-off events. [2023-08-26 19:11:29,138 INFO L125 PetriNetUnfolderBase]: For 618/624 co-relation queries the response was YES. [2023-08-26 19:11:29,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 1423 events. 732/1423 cut-off events. For 618/624 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8012 event pairs, 72 based on Foata normal form. 12/1291 useless extension candidates. Maximal degree in co-relation 3591. Up to 663 conditions per place. [2023-08-26 19:11:29,143 INFO L140 encePairwiseOnDemand]: 597/607 looper letters, 82 selfloop transitions, 14 changer transitions 18/120 dead transitions. [2023-08-26 19:11:29,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 674 flow [2023-08-26 19:11:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 19:11:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 19:11:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1558 transitions. [2023-08-26 19:11:29,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2851912868387333 [2023-08-26 19:11:29,145 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1558 transitions. [2023-08-26 19:11:29,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1558 transitions. [2023-08-26 19:11:29,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:29,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1558 transitions. [2023-08-26 19:11:29,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 173.11111111111111) internal successors, (1558), 9 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:11:29,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:11:29,152 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:11:29,152 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 223 flow. Second operand 9 states and 1558 transitions. [2023-08-26 19:11:29,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 674 flow [2023-08-26 19:11:29,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:11:29,156 INFO L231 Difference]: Finished difference. Result has 89 places, 64 transitions, 314 flow [2023-08-26 19:11:29,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=89, PETRI_TRANSITIONS=64} [2023-08-26 19:11:29,156 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -13 predicate places. [2023-08-26 19:11:29,156 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 64 transitions, 314 flow [2023-08-26 19:11:29,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 164.64705882352942) internal successors, (2799), 17 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have 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:11:29,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:29,157 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:29,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 19:11:29,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-26 19:11:29,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:29,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1465014250, now seen corresponding path program 2 times [2023-08-26 19:11:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410798827] [2023-08-26 19:11:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410798827] [2023-08-26 19:11:30,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410798827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276306728] [2023-08-26 19:11:30,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:11:30,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:30,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:30,120 INFO L229 MonitoredProcess]: Starting monitored process 12 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:11:30,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 19:11:30,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:11:30,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:11:30,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:11:30,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:30,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:11:30,356 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:30,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:11:30,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:30,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:30,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:11:30,460 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:30,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:11:30,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:11:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:11:30,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:30,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-26 19:11:30,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-26 19:11:48,752 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (|v_t_funThread2of2ForFork0_~i~0#1_105| Int) (|~#a~0.offset| Int) (v_ArrVal_684 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~i~0#1_112| |v_t_funThread2of2ForFork0_~i~0#1_105|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_684) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_105| 28) |~#a~0.offset|) v_ArrVal_687) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28) |~#a~0.offset|))))) is different from false [2023-08-26 19:11:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:11:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276306728] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:11:48,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:11:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2023-08-26 19:11:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519609840] [2023-08-26 19:11:48,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:11:48,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:11:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:11:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:11:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=332, Unknown=7, NotChecked=38, Total=462 [2023-08-26 19:11:48,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 607 [2023-08-26 19:11:48,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 64 transitions, 314 flow. Second operand has 22 states, 22 states have (on average 158.45454545454547) internal successors, (3486), 22 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have 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:11:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:11:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 607 [2023-08-26 19:11:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:11:52,450 INFO L124 PetriNetUnfolderBase]: 927/1902 cut-off events. [2023-08-26 19:11:52,450 INFO L125 PetriNetUnfolderBase]: For 2356/2374 co-relation queries the response was YES. [2023-08-26 19:11:52,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5918 conditions, 1902 events. 927/1902 cut-off events. For 2356/2374 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12101 event pairs, 64 based on Foata normal form. 24/1741 useless extension candidates. Maximal degree in co-relation 5856. Up to 858 conditions per place. [2023-08-26 19:11:52,458 INFO L140 encePairwiseOnDemand]: 596/607 looper letters, 120 selfloop transitions, 38 changer transitions 29/193 dead transitions. [2023-08-26 19:11:52,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 193 transitions, 1234 flow [2023-08-26 19:11:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 19:11:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 19:11:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2662 transitions. [2023-08-26 19:11:52,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27409390444810544 [2023-08-26 19:11:52,463 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2662 transitions. [2023-08-26 19:11:52,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2662 transitions. [2023-08-26 19:11:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:11:52,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2662 transitions. [2023-08-26 19:11:52,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 166.375) internal successors, (2662), 16 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have 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:11:52,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 607.0) internal successors, (10319), 17 states have internal predecessors, (10319), 0 states have call successors, (0), 0 states have 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:11:52,476 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 607.0) internal successors, (10319), 17 states have internal predecessors, (10319), 0 states have call successors, (0), 0 states have 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:11:52,476 INFO L175 Difference]: Start difference. First operand has 89 places, 64 transitions, 314 flow. Second operand 16 states and 2662 transitions. [2023-08-26 19:11:52,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 193 transitions, 1234 flow [2023-08-26 19:11:52,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 193 transitions, 1203 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:11:52,484 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 625 flow [2023-08-26 19:11:52,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=625, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2023-08-26 19:11:52,484 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2023-08-26 19:11:52,484 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 625 flow [2023-08-26 19:11:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 158.45454545454547) internal successors, (3486), 22 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have 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:11:52,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:11:52,485 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:11:52,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 19:11:52,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-26 19:11:52,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:11:52,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:11:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1704984431, now seen corresponding path program 1 times [2023-08-26 19:11:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:11:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973938376] [2023-08-26 19:11:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:11:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:11:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973938376] [2023-08-26 19:11:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973938376] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:11:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784664023] [2023-08-26 19:11:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:11:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:11:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:11:53,333 INFO L229 MonitoredProcess]: Starting monitored process 13 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:11:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 19:11:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:11:53,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-26 19:11:53,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:11:53,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:11:53,579 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:53,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:11:53,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:53,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:11:53,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:11:53,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:11:53,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:11:53,789 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:11:53,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:11:53,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:11:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:11:53,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:11:54,059 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 Int) (|v_t_funThread2of2ForFork0_~i~0#1_107| Int) (v_ArrVal_771 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_107| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_107| 1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_772) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_773) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_771) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_107|)))) is different from false [2023-08-26 19:11:54,093 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:11:54,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:11:54,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:11:54,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:11:54,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:11:54,174 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_114| Int) (v_ArrVal_773 Int) (|v_t_funThread2of2ForFork0_~i~0#1_107| Int) (|~#a~0.offset| Int) (v_ArrVal_772 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_107| 1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_772) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_114| 28) |~#a~0.offset|) v_ArrVal_773) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_107| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_107|)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_107| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_107| 1) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_114| Int) (v_ArrVal_773 Int) (|~#a~0.offset| Int) (v_ArrVal_772 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_772) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_114| 28) |~#a~0.offset|) v_ArrVal_773) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_107| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_114| |v_t_funThread2of2ForFork0_~i~0#1_107|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_107|)))) is different from false [2023-08-26 19:12:00,668 WARN L234 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:12:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 19:12:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784664023] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:12:01,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:12:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-26 19:12:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640789617] [2023-08-26 19:12:01,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:12:01,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:12:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:12:01,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:12:01,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=304, Unknown=3, NotChecked=74, Total=462 [2023-08-26 19:12:01,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 607 [2023-08-26 19:12:01,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 625 flow. Second operand has 22 states, 22 states have (on average 163.3181818181818) internal successors, (3593), 22 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have 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:12:01,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:12:01,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 607 [2023-08-26 19:12:01,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:12:02,515 INFO L124 PetriNetUnfolderBase]: 1154/2330 cut-off events. [2023-08-26 19:12:02,516 INFO L125 PetriNetUnfolderBase]: For 15177/15201 co-relation queries the response was YES. [2023-08-26 19:12:02,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9989 conditions, 2330 events. 1154/2330 cut-off events. For 15177/15201 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15598 event pairs, 237 based on Foata normal form. 24/2120 useless extension candidates. Maximal degree in co-relation 9916. Up to 1265 conditions per place. [2023-08-26 19:12:02,528 INFO L140 encePairwiseOnDemand]: 597/607 looper letters, 123 selfloop transitions, 36 changer transitions 26/191 dead transitions. [2023-08-26 19:12:02,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 191 transitions, 1607 flow [2023-08-26 19:12:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 19:12:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 19:12:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2559 transitions. [2023-08-26 19:12:02,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28105436573311365 [2023-08-26 19:12:02,531 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2559 transitions. [2023-08-26 19:12:02,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2559 transitions. [2023-08-26 19:12:02,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:12:02,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2559 transitions. [2023-08-26 19:12:02,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 170.6) internal successors, (2559), 15 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have 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:12:02,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 607.0) internal successors, (9712), 16 states have internal predecessors, (9712), 0 states have call successors, (0), 0 states have 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:12:02,540 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 607.0) internal successors, (9712), 16 states have internal predecessors, (9712), 0 states have call successors, (0), 0 states have 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:12:02,540 INFO L175 Difference]: Start difference. First operand has 112 places, 92 transitions, 625 flow. Second operand 15 states and 2559 transitions. [2023-08-26 19:12:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 191 transitions, 1607 flow [2023-08-26 19:12:02,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1559 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-08-26 19:12:02,569 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 942 flow [2023-08-26 19:12:02,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=942, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2023-08-26 19:12:02,570 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 26 predicate places. [2023-08-26 19:12:02,570 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 942 flow [2023-08-26 19:12:02,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 163.3181818181818) internal successors, (3593), 22 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have 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:12:02,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:12:02,570 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:12:02,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 19:12:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-26 19:12:02,776 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:12:02,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:12:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1163905295, now seen corresponding path program 2 times [2023-08-26 19:12:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:12:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251759386] [2023-08-26 19:12:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:12:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:12:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:12:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:12:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:12:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251759386] [2023-08-26 19:12:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251759386] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:12:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442315827] [2023-08-26 19:12:04,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:12:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:12:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:12:04,294 INFO L229 MonitoredProcess]: Starting monitored process 14 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:12:04,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 19:12:04,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:12:04,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:12:04,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 19:12:04,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:12:04,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:12:04,566 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:12:04,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:12:04,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:12:04,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:12:04,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:12:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:12:04,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:12:04,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:12:04,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:12:04,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:12:04,895 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:12:04,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:12:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:12:04,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:12:05,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_109| Int) (v_ArrVal_861 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_109| 28))) (or (= 0 (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_861) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0))))) is different from false [2023-08-26 19:12:05,157 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:12:05,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:12:05,169 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:12:05,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:12:05,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:12:13,754 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_855 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_116| Int)) (or (forall ((v_ArrVal_860 Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_109| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_855) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_116| 28) |~#a~0.offset|) v_ArrVal_860) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_109| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_116| |v_t_funThread2of2ForFork0_~i~0#1_109|))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_116|) (< |v_t_funThread1of2ForFork0_~i~0#1_116| 1))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-26 19:12:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:12:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442315827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:12:17,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:12:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2023-08-26 19:12:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626835701] [2023-08-26 19:12:17,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:12:17,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-26 19:12:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:12:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-26 19:12:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=404, Unknown=3, NotChecked=86, Total=600 [2023-08-26 19:12:17,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 607 [2023-08-26 19:12:17,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 942 flow. Second operand has 25 states, 25 states have (on average 157.16) internal successors, (3929), 25 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have 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:12:17,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:12:17,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 607 [2023-08-26 19:12:17,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:13:06,005 WARN L234 SmtUtils]: Spent 48.28s on a formula simplification. DAG size of input: 54 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:13:08,012 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 [1] [2023-08-26 19:13:10,021 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 [1] [2023-08-26 19:13:12,025 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 [1] [2023-08-26 19:13:14,031 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 [1] [2023-08-26 19:13:16,040 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 [1] [2023-08-26 19:13:18,044 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 [0, 1] [2023-08-26 19:13:20,051 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 [1] [2023-08-26 19:13:22,053 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 [1] [2023-08-26 19:13:24,111 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 [0, 1] [2023-08-26 19:13:26,114 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 [1] [2023-08-26 19:14:06,277 WARN L234 SmtUtils]: Spent 38.14s on a formula simplification. DAG size of input: 62 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:14:08,290 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 [1] [2023-08-26 19:14:10,300 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 [1] [2023-08-26 19:14:12,305 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 [1] [2023-08-26 19:14:14,310 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 [1] [2023-08-26 19:14:18,359 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 [1] [2023-08-26 19:14:20,362 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 [1] [2023-08-26 19:14:22,365 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 [1] [2023-08-26 19:14:24,422 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 [1] [2023-08-26 19:14:26,674 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 [1] [2023-08-26 19:14:28,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:15:07,046 WARN L234 SmtUtils]: Spent 36.22s on a formula simplification. DAG size of input: 63 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:15:09,115 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 [1] [2023-08-26 19:15:11,122 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 [1] [2023-08-26 19:15:13,136 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 [1] [2023-08-26 19:15:15,139 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 [1] [2023-08-26 19:15:17,142 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 [1] [2023-08-26 19:15:19,147 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 [1] [2023-08-26 19:15:21,154 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 [0, 1] [2023-08-26 19:15:23,158 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 [1] [2023-08-26 19:15:25,161 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 [1] [2023-08-26 19:15:27,196 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 [0, 1] [2023-08-26 19:15:29,198 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 [1] [2023-08-26 19:15:31,202 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 [1] [2023-08-26 19:16:01,621 WARN L234 SmtUtils]: Spent 30.24s on a formula simplification. DAG size of input: 62 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:16:03,629 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 [1] [2023-08-26 19:16:05,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 [1] [2023-08-26 19:16:07,635 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 [1] [2023-08-26 19:16:09,638 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 [1] [2023-08-26 19:16:11,639 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 [1] [2023-08-26 19:16:13,660 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 [1] [2023-08-26 19:16:15,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:16:17,697 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 [1] [2023-08-26 19:16:19,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:16:21,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:16:23,736 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 [1] [2023-08-26 19:16:25,738 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 [1] [2023-08-26 19:16:27,741 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 [1] [2023-08-26 19:16:29,746 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 [1] [2023-08-26 19:16:31,758 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 [1] [2023-08-26 19:16:42,422 INFO L124 PetriNetUnfolderBase]: 1417/2894 cut-off events. [2023-08-26 19:16:42,422 INFO L125 PetriNetUnfolderBase]: For 20204/20228 co-relation queries the response was YES. [2023-08-26 19:16:42,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12523 conditions, 2894 events. 1417/2894 cut-off events. For 20204/20228 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20472 event pairs, 238 based on Foata normal form. 12/2617 useless extension candidates. Maximal degree in co-relation 12446. Up to 1588 conditions per place. [2023-08-26 19:16:42,437 INFO L140 encePairwiseOnDemand]: 591/607 looper letters, 138 selfloop transitions, 66 changer transitions 30/240 dead transitions. [2023-08-26 19:16:42,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 240 transitions, 2369 flow [2023-08-26 19:16:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 19:16:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 19:16:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3576 transitions. [2023-08-26 19:16:42,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2677849333533024 [2023-08-26 19:16:42,442 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3576 transitions. [2023-08-26 19:16:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3576 transitions. [2023-08-26 19:16:42,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:42,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3576 transitions. [2023-08-26 19:16:42,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 162.54545454545453) internal successors, (3576), 22 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:16:42,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 607.0) internal successors, (13961), 23 states have internal predecessors, (13961), 0 states have call successors, (0), 0 states have 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:16:42,456 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 607.0) internal successors, (13961), 23 states have internal predecessors, (13961), 0 states have call successors, (0), 0 states have 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:16:42,456 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 942 flow. Second operand 22 states and 3576 transitions. [2023-08-26 19:16:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 240 transitions, 2369 flow [2023-08-26 19:16:42,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 240 transitions, 1884 flow, removed 201 selfloop flow, removed 6 redundant places. [2023-08-26 19:16:42,492 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 1215 flow [2023-08-26 19:16:42,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1215, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2023-08-26 19:16:42,493 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 49 predicate places. [2023-08-26 19:16:42,493 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 1215 flow [2023-08-26 19:16:42,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 157.16) internal successors, (3929), 25 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have 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:16:42,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:42,494 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:42,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 19:16:42,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 19:16:42,699 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:16:42,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1684819611, now seen corresponding path program 3 times [2023-08-26 19:16:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488776916] [2023-08-26 19:16:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:16:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488776916] [2023-08-26 19:16:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488776916] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:16:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300545520] [2023-08-26 19:16:44,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:16:44,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:44,381 INFO L229 MonitoredProcess]: Starting monitored process 15 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:16:44,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 19:16:44,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 19:16:44,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:16:44,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 19:16:44,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:16:44,534 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:16:44,665 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:16:44,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:16:44,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:16:44,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:16:44,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:16:44,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:16:44,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:16:44,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:16:44,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:16:45,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:16:45,093 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:16:45,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:16:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:16:45,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:16:45,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_111| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_947) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|)))) is different from false [2023-08-26 19:16:45,395 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_111| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_946 Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_946)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_947) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|)))) is different from false [2023-08-26 19:16:45,509 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:16:45,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:16:45,525 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:16:45,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:16:45,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:16:45,601 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_111| Int) (|v_t_funThread1of2ForFork0_~i~0#1_118| Int) (v_ArrVal_948 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_946 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_118| 28) |~#a~0.offset|) v_ArrVal_946)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_111| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_118| Int) (v_ArrVal_948 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_946 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_118| 28) |~#a~0.offset|) v_ArrVal_946)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_118| |v_t_funThread2of2ForFork0_~i~0#1_111|))))))) is different from false [2023-08-26 19:16:47,666 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~i~0#1_111| Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_118| Int) (v_ArrVal_948 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_946 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_118| 28) |~#a~0.offset|) v_ArrVal_946))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_941 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_111| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_111| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_111|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_118| Int) (v_ArrVal_948 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_946 Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_118| 28) |~#a~0.offset|) v_ArrVal_946))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_948) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_118| |v_t_funThread2of2ForFork0_~i~0#1_111|)))))) is different from false [2023-08-26 19:16:54,745 WARN L234 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:16:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 19:16:55,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300545520] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:16:55,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:16:55,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 24 [2023-08-26 19:16:55,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565927936] [2023-08-26 19:16:55,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:16:55,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 19:16:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 19:16:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=370, Unknown=5, NotChecked=172, Total=650 [2023-08-26 19:16:55,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 607 [2023-08-26 19:16:55,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 1215 flow. Second operand has 26 states, 26 states have (on average 157.07692307692307) internal successors, (4084), 26 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have 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:16:55,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:55,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 607 [2023-08-26 19:16:55,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:58,355 INFO L124 PetriNetUnfolderBase]: 1382/2827 cut-off events. [2023-08-26 19:16:58,355 INFO L125 PetriNetUnfolderBase]: For 14359/14383 co-relation queries the response was YES. [2023-08-26 19:16:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11856 conditions, 2827 events. 1382/2827 cut-off events. For 14359/14383 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19769 event pairs, 165 based on Foata normal form. 4/2534 useless extension candidates. Maximal degree in co-relation 11772. Up to 1312 conditions per place. [2023-08-26 19:16:58,370 INFO L140 encePairwiseOnDemand]: 598/607 looper letters, 156 selfloop transitions, 64 changer transitions 23/249 dead transitions. [2023-08-26 19:16:58,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 249 transitions, 2298 flow [2023-08-26 19:16:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 19:16:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 19:16:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2787 transitions. [2023-08-26 19:16:58,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27008431049520304 [2023-08-26 19:16:58,376 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2787 transitions. [2023-08-26 19:16:58,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2787 transitions. [2023-08-26 19:16:58,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:58,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2787 transitions. [2023-08-26 19:16:58,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 163.94117647058823) internal successors, (2787), 17 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have 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:16:58,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 607.0) internal successors, (10926), 18 states have internal predecessors, (10926), 0 states have call successors, (0), 0 states have 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:16:58,386 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 607.0) internal successors, (10926), 18 states have internal predecessors, (10926), 0 states have call successors, (0), 0 states have 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:16:58,386 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 1215 flow. Second operand 17 states and 2787 transitions. [2023-08-26 19:16:58,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 249 transitions, 2298 flow [2023-08-26 19:16:58,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 249 transitions, 2133 flow, removed 75 selfloop flow, removed 3 redundant places. [2023-08-26 19:16:58,446 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 1377 flow [2023-08-26 19:16:58,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1377, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2023-08-26 19:16:58,447 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 65 predicate places. [2023-08-26 19:16:58,447 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 1377 flow [2023-08-26 19:16:58,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 157.07692307692307) internal successors, (4084), 26 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have 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:16:58,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:58,447 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:58,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 19:16:58,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:58,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:16:58,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -229137457, now seen corresponding path program 4 times [2023-08-26 19:16:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96866525] [2023-08-26 19:16:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:16:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96866525] [2023-08-26 19:16:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96866525] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:16:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375208109] [2023-08-26 19:16:58,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 19:16:58,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:58,953 INFO L229 MonitoredProcess]: Starting monitored process 16 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:16:58,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 19:16:59,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 19:16:59,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:16:59,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:16:59,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:16:59,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:16:59,197 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:16:59,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:16:59,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:16:59,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:16:59,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:16:59,327 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:16:59,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:16:59,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:16:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:16:59,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:16:59,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-26 19:16:59,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-26 19:17:05,704 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_113| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1029) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_113| 28) |~#a~0.offset|)) 0)) is different from false [2023-08-26 19:17:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:17:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375208109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:05,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-26 19:17:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723377558] [2023-08-26 19:17:05,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:05,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 19:17:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 19:17:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=171, Unknown=3, NotChecked=28, Total=272 [2023-08-26 19:17:05,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 607 [2023-08-26 19:17:05,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 1377 flow. Second operand has 17 states, 17 states have (on average 164.64705882352942) internal successors, (2799), 17 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have 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:17:05,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:05,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 607 [2023-08-26 19:17:05,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:06,565 INFO L124 PetriNetUnfolderBase]: 1419/2886 cut-off events. [2023-08-26 19:17:06,565 INFO L125 PetriNetUnfolderBase]: For 16735/16761 co-relation queries the response was YES. [2023-08-26 19:17:06,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12789 conditions, 2886 events. 1419/2886 cut-off events. For 16735/16761 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20462 event pairs, 310 based on Foata normal form. 12/2592 useless extension candidates. Maximal degree in co-relation 12701. Up to 1931 conditions per place. [2023-08-26 19:17:06,582 INFO L140 encePairwiseOnDemand]: 597/607 looper letters, 162 selfloop transitions, 33 changer transitions 15/216 dead transitions. [2023-08-26 19:17:06,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 216 transitions, 2073 flow [2023-08-26 19:17:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 19:17:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 19:17:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1553 transitions. [2023-08-26 19:17:06,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2842760388065166 [2023-08-26 19:17:06,584 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1553 transitions. [2023-08-26 19:17:06,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1553 transitions. [2023-08-26 19:17:06,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:06,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1553 transitions. [2023-08-26 19:17:06,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.55555555555554) internal successors, (1553), 9 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have 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:17:06,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:17:06,589 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:17:06,589 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 1377 flow. Second operand 9 states and 1553 transitions. [2023-08-26 19:17:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 216 transitions, 2073 flow [2023-08-26 19:17:06,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 216 transitions, 2004 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-08-26 19:17:06,627 INFO L231 Difference]: Finished difference. Result has 173 places, 172 transitions, 1481 flow [2023-08-26 19:17:06,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1481, PETRI_PLACES=173, PETRI_TRANSITIONS=172} [2023-08-26 19:17:06,627 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 71 predicate places. [2023-08-26 19:17:06,627 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 172 transitions, 1481 flow [2023-08-26 19:17:06,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 164.64705882352942) internal successors, (2799), 17 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have 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:17:06,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:06,628 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:06,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:06,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 19:17:06,831 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:17:06,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 203787178, now seen corresponding path program 3 times [2023-08-26 19:17:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969529263] [2023-08-26 19:17:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:17:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969529263] [2023-08-26 19:17:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969529263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590795318] [2023-08-26 19:17:07,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:17:07,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:07,293 INFO L229 MonitoredProcess]: Starting monitored process 17 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:17:07,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-26 19:17:07,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 19:17:07,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:07,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 19:17:07,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:07,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:17:07,584 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:07,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:17:07,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:07,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:07,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:17:07,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:17:07,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:17:07,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:17:07,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:17:07,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:17:07,899 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:07,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:17:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:17:07,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:08,032 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_122| Int) (v_ArrVal_1120 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_122| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1120) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-26 19:17:08,131 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:17:08,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:17:08,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:17:08,143 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:17:08,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:17:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:17:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590795318] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:21,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-26 19:17:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463375404] [2023-08-26 19:17:21,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:21,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 19:17:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:21,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 19:17:21,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=267, Unknown=5, NotChecked=36, Total=420 [2023-08-26 19:17:21,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 607 [2023-08-26 19:17:21,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 172 transitions, 1481 flow. Second operand has 21 states, 21 states have (on average 163.38095238095238) internal successors, (3431), 21 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have 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:17:21,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:21,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 607 [2023-08-26 19:17:21,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:22,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_122| Int) (v_ArrVal_1120 (Array Int Int)) (v_ArrVal_1119 Int)) (let ((.cse1 (* |v_t_funThread1of2ForFork0_~i~0#1_122| 28))) (or (= (select (store .cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1119) (+ .cse1 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1120) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| (- 24))) 0))))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_122| Int)) (let ((.cse2 (* |v_t_funThread1of2ForFork0_~i~0#1_122| 28))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| (- 24))) 0)) (= (select .cse0 (+ .cse2 |c_~#a~0.offset|)) 0)))))) is different from false [2023-08-26 19:17:22,336 INFO L124 PetriNetUnfolderBase]: 1471/3060 cut-off events. [2023-08-26 19:17:22,336 INFO L125 PetriNetUnfolderBase]: For 18703/18705 co-relation queries the response was YES. [2023-08-26 19:17:22,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13561 conditions, 3060 events. 1471/3060 cut-off events. For 18703/18705 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22520 event pairs, 320 based on Foata normal form. 14/2750 useless extension candidates. Maximal degree in co-relation 13469. Up to 1830 conditions per place. [2023-08-26 19:17:22,352 INFO L140 encePairwiseOnDemand]: 594/607 looper letters, 154 selfloop transitions, 51 changer transitions 14/225 dead transitions. [2023-08-26 19:17:22,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 225 transitions, 2270 flow [2023-08-26 19:17:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 19:17:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 19:17:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1708 transitions. [2023-08-26 19:17:22,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2813838550247117 [2023-08-26 19:17:22,354 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1708 transitions. [2023-08-26 19:17:22,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1708 transitions. [2023-08-26 19:17:22,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:22,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1708 transitions. [2023-08-26 19:17:22,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 170.8) internal successors, (1708), 10 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have 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:17:22,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 607.0) internal successors, (6677), 11 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have 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:17:22,360 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 607.0) internal successors, (6677), 11 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have 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:17:22,360 INFO L175 Difference]: Start difference. First operand has 173 places, 172 transitions, 1481 flow. Second operand 10 states and 1708 transitions. [2023-08-26 19:17:22,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 225 transitions, 2270 flow [2023-08-26 19:17:22,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 225 transitions, 2180 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-26 19:17:22,415 INFO L231 Difference]: Finished difference. Result has 179 places, 187 transitions, 1711 flow [2023-08-26 19:17:22,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1711, PETRI_PLACES=179, PETRI_TRANSITIONS=187} [2023-08-26 19:17:22,416 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 77 predicate places. [2023-08-26 19:17:22,416 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 187 transitions, 1711 flow [2023-08-26 19:17:22,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 163.38095238095238) internal successors, (3431), 21 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have 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:17:22,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:22,417 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:22,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:22,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 19:17:22,621 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:17:22,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1153873178, now seen corresponding path program 4 times [2023-08-26 19:17:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189880491] [2023-08-26 19:17:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:17:23,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:23,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189880491] [2023-08-26 19:17:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189880491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803698899] [2023-08-26 19:17:23,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 19:17:23,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:23,201 INFO L229 MonitoredProcess]: Starting monitored process 18 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:17:23,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-26 19:17:23,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 19:17:23,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:23,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-26 19:17:23,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:23,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:17:23,419 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:23,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:17:23,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:23,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:17:23,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:23,523 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:23,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:17:23,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:17:23,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:17:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:17:23,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:23,732 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1210) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-26 19:17:23,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-26 19:17:23,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-26 19:17:25,927 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_124| Int) (|v_t_funThread2of2ForFork0_~i~0#1_117| Int) (|~#a~0.offset| Int) (v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1208 Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_124| |v_t_funThread2of2ForFork0_~i~0#1_117|) (< |v_t_funThread2of2ForFork0_~i~0#1_117| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_117|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_1208)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1210) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_124| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-26 19:17:27,958 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_124| Int) (v_ArrVal_1204 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_117| Int) (|~#a~0.offset| Int) (v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1208 Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_124| |v_t_funThread2of2ForFork0_~i~0#1_117|) (< |v_t_funThread2of2ForFork0_~i~0#1_117| 1) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1204))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_1208))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1210) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_124| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_117|))) is different from false [2023-08-26 19:17:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-08-26 19:17:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803698899] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:28,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-26 19:17:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901129605] [2023-08-26 19:17:28,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:28,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-26 19:17:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-26 19:17:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=182, Unknown=4, NotChecked=90, Total=342 [2023-08-26 19:17:28,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 607 [2023-08-26 19:17:28,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 187 transitions, 1711 flow. Second operand has 19 states, 19 states have (on average 164.89473684210526) internal successors, (3133), 19 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:17:28,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:28,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 607 [2023-08-26 19:17:28,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:29,077 INFO L124 PetriNetUnfolderBase]: 1466/3073 cut-off events. [2023-08-26 19:17:29,078 INFO L125 PetriNetUnfolderBase]: For 20568/20594 co-relation queries the response was YES. [2023-08-26 19:17:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14469 conditions, 3073 events. 1466/3073 cut-off events. For 20568/20594 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22732 event pairs, 330 based on Foata normal form. 6/2761 useless extension candidates. Maximal degree in co-relation 14374. Up to 2035 conditions per place. [2023-08-26 19:17:29,096 INFO L140 encePairwiseOnDemand]: 598/607 looper letters, 156 selfloop transitions, 26 changer transitions 46/234 dead transitions. [2023-08-26 19:17:29,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 234 transitions, 2436 flow [2023-08-26 19:17:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 19:17:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 19:17:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1553 transitions. [2023-08-26 19:17:29,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2842760388065166 [2023-08-26 19:17:29,099 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1553 transitions. [2023-08-26 19:17:29,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1553 transitions. [2023-08-26 19:17:29,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:29,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1553 transitions. [2023-08-26 19:17:29,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.55555555555554) internal successors, (1553), 9 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have 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:17:29,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:17:29,104 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:17:29,104 INFO L175 Difference]: Start difference. First operand has 179 places, 187 transitions, 1711 flow. Second operand 9 states and 1553 transitions. [2023-08-26 19:17:29,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 234 transitions, 2436 flow [2023-08-26 19:17:29,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 234 transitions, 2267 flow, removed 60 selfloop flow, removed 5 redundant places. [2023-08-26 19:17:29,162 INFO L231 Difference]: Finished difference. Result has 185 places, 177 transitions, 1509 flow [2023-08-26 19:17:29,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1509, PETRI_PLACES=185, PETRI_TRANSITIONS=177} [2023-08-26 19:17:29,163 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 83 predicate places. [2023-08-26 19:17:29,163 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 177 transitions, 1509 flow [2023-08-26 19:17:29,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 164.89473684210526) internal successors, (3133), 19 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:17:29,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:29,164 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:29,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:29,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:29,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:17:29,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1899178803, now seen corresponding path program 5 times [2023-08-26 19:17:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618235680] [2023-08-26 19:17:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:17:32,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618235680] [2023-08-26 19:17:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618235680] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620106134] [2023-08-26 19:17:32,153 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 19:17:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:32,154 INFO L229 MonitoredProcess]: Starting monitored process 19 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:17:32,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-26 19:17:32,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-26 19:17:32,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:32,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 19:17:32,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:32,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:17:32,533 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:32,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:17:32,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:32,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:17:32,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:17:32,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:17:32,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:32,761 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:32,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:17:32,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:17:32,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:17:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:17:32,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:33,464 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:17:33,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:17:33,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:17:33,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:17:33,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:17:35,524 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_119| Int)) (or (forall ((v_ArrVal_1299 Int) (v_ArrVal_1301 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_126| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_126| |v_t_funThread2of2ForFork0_~i~0#1_119|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_126| 28) |~#a~0.offset|) v_ArrVal_1299)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1301) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_119| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_119|) (< |v_t_funThread2of2ForFork0_~i~0#1_119| 1))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1299 Int) (v_ArrVal_1301 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_126| Int) (|v_t_funThread2of2ForFork0_~i~0#1_119| Int) (|~#a~0.offset| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_119|) (< |v_t_funThread2of2ForFork0_~i~0#1_119| 1) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_126| 28) |~#a~0.offset|) v_ArrVal_1299)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1301) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_119| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-08-26 19:17:37,580 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_119| Int) (v_ArrVal_1294 (Array Int Int))) (or (forall ((v_ArrVal_1299 Int) (v_ArrVal_1301 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_126| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_126| |v_t_funThread2of2ForFork0_~i~0#1_119|) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1294))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_126| 28) |~#a~0.offset|) v_ArrVal_1299))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1301) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_119| 28) |~#a~0.offset|))))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_119|) (< |v_t_funThread2of2ForFork0_~i~0#1_119| 1))) (or (forall ((v_ArrVal_1299 Int) (v_ArrVal_1301 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_126| Int) (|v_t_funThread2of2ForFork0_~i~0#1_119| Int) (|~#a~0.offset| Int) (v_ArrVal_1294 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_119|) (< |v_t_funThread2of2ForFork0_~i~0#1_119| 1) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1294))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_126| 28) |~#a~0.offset|) v_ArrVal_1299))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1301) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_119| 28) |~#a~0.offset|))))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-26 19:17:43,947 WARN L234 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:17:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 19:17:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620106134] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:44,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:44,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-26 19:17:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994015806] [2023-08-26 19:17:44,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:17:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:17:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=878, Unknown=8, NotChecked=126, Total=1190 [2023-08-26 19:17:44,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 607 [2023-08-26 19:17:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 177 transitions, 1509 flow. Second operand has 35 states, 35 states have (on average 148.97142857142856) internal successors, (5214), 35 states have internal predecessors, (5214), 0 states have call successors, (0), 0 states have 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:17:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 607 [2023-08-26 19:17:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:55,127 INFO L124 PetriNetUnfolderBase]: 1590/3401 cut-off events. [2023-08-26 19:17:55,127 INFO L125 PetriNetUnfolderBase]: For 20249/20273 co-relation queries the response was YES. [2023-08-26 19:17:55,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15302 conditions, 3401 events. 1590/3401 cut-off events. For 20249/20273 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 25939 event pairs, 259 based on Foata normal form. 25/3073 useless extension candidates. Maximal degree in co-relation 15215. Up to 1147 conditions per place. [2023-08-26 19:17:55,145 INFO L140 encePairwiseOnDemand]: 590/607 looper letters, 135 selfloop transitions, 63 changer transitions 131/335 dead transitions. [2023-08-26 19:17:55,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 335 transitions, 3187 flow [2023-08-26 19:17:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-26 19:17:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-26 19:17:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5207 transitions. [2023-08-26 19:17:55,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2523015796104274 [2023-08-26 19:17:55,150 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 5207 transitions. [2023-08-26 19:17:55,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 5207 transitions. [2023-08-26 19:17:55,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:55,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 5207 transitions. [2023-08-26 19:17:55,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 153.14705882352942) internal successors, (5207), 34 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have 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:17:55,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 607.0) internal successors, (21245), 35 states have internal predecessors, (21245), 0 states have call successors, (0), 0 states have 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:17:55,169 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 607.0) internal successors, (21245), 35 states have internal predecessors, (21245), 0 states have call successors, (0), 0 states have 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:17:55,169 INFO L175 Difference]: Start difference. First operand has 185 places, 177 transitions, 1509 flow. Second operand 34 states and 5207 transitions. [2023-08-26 19:17:55,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 335 transitions, 3187 flow [2023-08-26 19:17:55,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 335 transitions, 3101 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-08-26 19:17:55,227 INFO L231 Difference]: Finished difference. Result has 213 places, 162 transitions, 1516 flow [2023-08-26 19:17:55,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1516, PETRI_PLACES=213, PETRI_TRANSITIONS=162} [2023-08-26 19:17:55,228 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 111 predicate places. [2023-08-26 19:17:55,228 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 162 transitions, 1516 flow [2023-08-26 19:17:55,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 148.97142857142856) internal successors, (5214), 35 states have internal predecessors, (5214), 0 states have call successors, (0), 0 states have 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:17:55,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:55,229 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:55,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-26 19:17:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:55,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:17:55,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash 369383727, now seen corresponding path program 6 times [2023-08-26 19:17:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559125894] [2023-08-26 19:17:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:17:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559125894] [2023-08-26 19:17:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559125894] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105153663] [2023-08-26 19:17:56,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 19:17:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:56,160 INFO L229 MonitoredProcess]: Starting monitored process 20 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:17:56,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-26 19:17:56,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-26 19:17:56,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:56,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-26 19:17:56,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:56,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:17:56,626 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:56,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:17:56,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:56,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:17:56,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:17:56,728 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:17:56,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:17:56,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:17:56,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:17:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:17:56,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:56,906 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1391) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-26 19:17:57,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-26 19:17:57,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-26 19:17:59,044 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_121| Int) (|v_t_funThread1of2ForFork0_~i~0#1_128| Int) (v_ArrVal_1389 Int) (|~#a~0.offset| Int) (v_ArrVal_1391 (Array Int Int))) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_128|) (= |v_t_funThread1of2ForFork0_~i~0#1_128| |v_t_funThread2of2ForFork0_~i~0#1_121|) (< |v_t_funThread1of2ForFork0_~i~0#1_128| 1) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_128| 28) |~#a~0.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1391) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_121| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-26 19:18:01,073 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_121| Int) (|v_t_funThread1of2ForFork0_~i~0#1_128| Int) (v_ArrVal_1389 Int) (v_ArrVal_1386 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1391 (Array Int Int))) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_128|) (= |v_t_funThread1of2ForFork0_~i~0#1_128| |v_t_funThread2of2ForFork0_~i~0#1_121|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1386))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_128| 28) |~#a~0.offset|) v_ArrVal_1389))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1391) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_121| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_128| 1))) is different from false [2023-08-26 19:18:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:18:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105153663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:18:01,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:18:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 22 [2023-08-26 19:18:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633486283] [2023-08-26 19:18:01,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:18:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 19:18:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:18:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 19:18:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=344, Unknown=6, NotChecked=120, Total=552 [2023-08-26 19:18:01,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 607 [2023-08-26 19:18:01,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 162 transitions, 1516 flow. Second operand has 24 states, 24 states have (on average 158.33333333333334) internal successors, (3800), 24 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have 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:18:01,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:18:01,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 607 [2023-08-26 19:18:01,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:18:02,495 INFO L124 PetriNetUnfolderBase]: 1052/2309 cut-off events. [2023-08-26 19:18:02,495 INFO L125 PetriNetUnfolderBase]: For 16075/16101 co-relation queries the response was YES. [2023-08-26 19:18:02,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11153 conditions, 2309 events. 1052/2309 cut-off events. For 16075/16101 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16612 event pairs, 248 based on Foata normal form. 5/2094 useless extension candidates. Maximal degree in co-relation 11040. Up to 1523 conditions per place. [2023-08-26 19:18:02,508 INFO L140 encePairwiseOnDemand]: 594/607 looper letters, 132 selfloop transitions, 19 changer transitions 54/211 dead transitions. [2023-08-26 19:18:02,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 211 transitions, 2250 flow [2023-08-26 19:18:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 19:18:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 19:18:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1818 transitions. [2023-08-26 19:18:02,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2722779691478209 [2023-08-26 19:18:02,511 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1818 transitions. [2023-08-26 19:18:02,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1818 transitions. [2023-08-26 19:18:02,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:18:02,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1818 transitions. [2023-08-26 19:18:02,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.27272727272728) internal successors, (1818), 11 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:18:02,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 607.0) internal successors, (7284), 12 states have internal predecessors, (7284), 0 states have call successors, (0), 0 states have 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:18:02,517 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 607.0) internal successors, (7284), 12 states have internal predecessors, (7284), 0 states have call successors, (0), 0 states have 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:18:02,517 INFO L175 Difference]: Start difference. First operand has 213 places, 162 transitions, 1516 flow. Second operand 11 states and 1818 transitions. [2023-08-26 19:18:02,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 211 transitions, 2250 flow [2023-08-26 19:18:02,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 211 transitions, 2009 flow, removed 70 selfloop flow, removed 39 redundant places. [2023-08-26 19:18:02,572 INFO L231 Difference]: Finished difference. Result has 173 places, 151 transitions, 1266 flow [2023-08-26 19:18:02,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1266, PETRI_PLACES=173, PETRI_TRANSITIONS=151} [2023-08-26 19:18:02,572 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 71 predicate places. [2023-08-26 19:18:02,573 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 151 transitions, 1266 flow [2023-08-26 19:18:02,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 158.33333333333334) internal successors, (3800), 24 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have 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:18:02,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:18:02,573 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:18:02,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-26 19:18:02,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:18:02,774 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:18:02,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:18:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1302708998, now seen corresponding path program 5 times [2023-08-26 19:18:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:18:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365345274] [2023-08-26 19:18:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:18:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:18:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:18:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:18:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:18:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365345274] [2023-08-26 19:18:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365345274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:18:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253198681] [2023-08-26 19:18:03,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 19:18:03,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:18:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:18:03,153 INFO L229 MonitoredProcess]: Starting monitored process 21 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:18:03,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-26 19:18:03,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-26 19:18:03,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:18:03,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 19:18:03,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:18:03,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:18:03,621 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:18:03,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:18:03,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:18:03,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:18:03,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:18:03,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:18:03,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:18:03,800 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:18:03,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:18:03,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:18:03,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:18:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:18:03,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:18:04,168 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:18:04,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 80 [2023-08-26 19:18:04,189 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:18:04,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 121 [2023-08-26 19:18:04,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2023-08-26 19:18:04,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2023-08-26 19:18:04,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2023-08-26 19:18:12,384 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1476 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_130| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1476) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_130| 28))) 0)) (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-26 19:18:23,347 WARN L234 SmtUtils]: Spent 10.91s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:18:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:18:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253198681] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:18:23,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:18:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-08-26 19:18:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303438797] [2023-08-26 19:18:23,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:18:23,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:18:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:18:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:18:23,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=4, NotChecked=38, Total=462 [2023-08-26 19:18:23,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 607 [2023-08-26 19:18:23,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 151 transitions, 1266 flow. Second operand has 22 states, 22 states have (on average 163.5) internal successors, (3597), 22 states have internal predecessors, (3597), 0 states have call successors, (0), 0 states have 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:18:23,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:18:23,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 607 [2023-08-26 19:18:23,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:18:24,770 INFO L124 PetriNetUnfolderBase]: 988/2212 cut-off events. [2023-08-26 19:18:24,771 INFO L125 PetriNetUnfolderBase]: For 12127/12129 co-relation queries the response was YES. [2023-08-26 19:18:24,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10090 conditions, 2212 events. 988/2212 cut-off events. For 12127/12129 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16025 event pairs, 262 based on Foata normal form. 14/2014 useless extension candidates. Maximal degree in co-relation 10008. Up to 910 conditions per place. [2023-08-26 19:18:24,781 INFO L140 encePairwiseOnDemand]: 594/607 looper letters, 112 selfloop transitions, 16 changer transitions 105/239 dead transitions. [2023-08-26 19:18:24,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 239 transitions, 2277 flow [2023-08-26 19:18:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 19:18:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 19:18:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2394 transitions. [2023-08-26 19:18:24,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28171334431630973 [2023-08-26 19:18:24,784 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2394 transitions. [2023-08-26 19:18:24,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2394 transitions. [2023-08-26 19:18:24,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:18:24,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2394 transitions. [2023-08-26 19:18:24,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 171.0) internal successors, (2394), 14 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have 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:18:24,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 607.0) internal successors, (9105), 15 states have internal predecessors, (9105), 0 states have call successors, (0), 0 states have 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:18:24,793 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 607.0) internal successors, (9105), 15 states have internal predecessors, (9105), 0 states have call successors, (0), 0 states have 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:18:24,793 INFO L175 Difference]: Start difference. First operand has 173 places, 151 transitions, 1266 flow. Second operand 14 states and 2394 transitions. [2023-08-26 19:18:24,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 239 transitions, 2277 flow [2023-08-26 19:18:24,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 239 transitions, 2190 flow, removed 20 selfloop flow, removed 14 redundant places. [2023-08-26 19:18:24,833 INFO L231 Difference]: Finished difference. Result has 171 places, 126 transitions, 1051 flow [2023-08-26 19:18:24,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1051, PETRI_PLACES=171, PETRI_TRANSITIONS=126} [2023-08-26 19:18:24,835 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 69 predicate places. [2023-08-26 19:18:24,835 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 126 transitions, 1051 flow [2023-08-26 19:18:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 163.5) internal successors, (3597), 22 states have internal predecessors, (3597), 0 states have call successors, (0), 0 states have 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:18:24,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:18:24,836 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:18:24,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-26 19:18:25,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-26 19:18:25,042 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:18:25,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:18:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1187773248, now seen corresponding path program 6 times [2023-08-26 19:18:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:18:25,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303274100] [2023-08-26 19:18:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:18:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:18:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:18:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:18:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:18:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303274100] [2023-08-26 19:18:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303274100] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:18:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207690780] [2023-08-26 19:18:27,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 19:18:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:18:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:18:27,447 INFO L229 MonitoredProcess]: Starting monitored process 22 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:18:27,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-26 19:18:27,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-26 19:18:27,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:18:27,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 19:18:27,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:18:27,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:18:27,887 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:18:27,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:18:27,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:18:27,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:18:27,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-26 19:18:28,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:18:28,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:18:28,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-26 19:18:28,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 19:18:28,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:18:28,221 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:18:28,280 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:18:28,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-26 19:18:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:18:28,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:18:28,788 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:18:28,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 19:18:28,798 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:18:28,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-26 19:18:28,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-26 19:18:30,842 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_125| Int) (v_ArrVal_1572 Int) (|~#a~0.offset| Int) (v_ArrVal_1573 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1)))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_125| Int) (v_ArrVal_1572 Int) (|~#a~0.offset| Int) (v_ArrVal_1573 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_132| |v_t_funThread2of2ForFork0_~i~0#1_125|))))))) is different from false [2023-08-26 19:18:32,888 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1567 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_125| Int) (v_ArrVal_1572 Int) (|~#a~0.offset| Int) (v_ArrVal_1573 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~i~0#1_132| |v_t_funThread2of2ForFork0_~i~0#1_125|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1567))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1572))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28) |~#a~0.offset|)) 0))))) (or (forall ((v_ArrVal_1567 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_125| Int) (v_ArrVal_1572 Int) (|~#a~0.offset| Int) (v_ArrVal_1573 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1567))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1572))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-26 19:18:41,133 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:18:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:18:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207690780] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:18:41,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:18:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8] total 26 [2023-08-26 19:18:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062017397] [2023-08-26 19:18:41,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:18:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 19:18:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:18:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 19:18:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=515, Unknown=6, NotChecked=98, Total=756 [2023-08-26 19:18:41,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 607 [2023-08-26 19:18:41,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 126 transitions, 1051 flow. Second operand has 28 states, 28 states have (on average 157.10714285714286) internal successors, (4399), 28 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states have 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:18:41,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:18:41,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 607 [2023-08-26 19:18:41,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:18:49,635 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:19:03,232 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 124 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:19:06,468 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1574) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1)))) (forall ((v_ArrVal_1574 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (let ((.cse1 (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1574) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1 (- 24))))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1) (= (select .cse2 (+ |c_~#a~0.offset| .cse1)) 0)))) (forall ((v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_132| Int)) (let ((.cse3 (* |v_t_funThread1of2ForFork0_~i~0#1_132| 28))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1574) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse3 (- 24))))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_132|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1573) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse3)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_132| 1)))))) is different from false [2023-08-26 19:19:09,954 INFO L124 PetriNetUnfolderBase]: 564/1309 cut-off events. [2023-08-26 19:19:09,954 INFO L125 PetriNetUnfolderBase]: For 9134/9136 co-relation queries the response was YES. [2023-08-26 19:19:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6199 conditions, 1309 events. 564/1309 cut-off events. For 9134/9136 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8495 event pairs, 161 based on Foata normal form. 11/1215 useless extension candidates. Maximal degree in co-relation 6149. Up to 899 conditions per place. [2023-08-26 19:19:09,961 INFO L140 encePairwiseOnDemand]: 593/607 looper letters, 118 selfloop transitions, 48 changer transitions 30/202 dead transitions. [2023-08-26 19:19:09,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 202 transitions, 1962 flow [2023-08-26 19:19:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 19:19:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 19:19:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3388 transitions. [2023-08-26 19:19:09,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26578802855573863 [2023-08-26 19:19:09,964 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3388 transitions. [2023-08-26 19:19:09,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3388 transitions. [2023-08-26 19:19:09,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:19:09,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3388 transitions. [2023-08-26 19:19:09,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 161.33333333333334) internal successors, (3388), 21 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have 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:19:09,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 607.0) internal successors, (13354), 22 states have internal predecessors, (13354), 0 states have call successors, (0), 0 states have 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:19:09,975 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 607.0) internal successors, (13354), 22 states have internal predecessors, (13354), 0 states have call successors, (0), 0 states have 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:19:09,975 INFO L175 Difference]: Start difference. First operand has 171 places, 126 transitions, 1051 flow. Second operand 21 states and 3388 transitions. [2023-08-26 19:19:09,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 202 transitions, 1962 flow [2023-08-26 19:19:09,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 202 transitions, 1787 flow, removed 62 selfloop flow, removed 20 redundant places. [2023-08-26 19:19:09,999 INFO L231 Difference]: Finished difference. Result has 161 places, 146 transitions, 1276 flow [2023-08-26 19:19:09,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1276, PETRI_PLACES=161, PETRI_TRANSITIONS=146} [2023-08-26 19:19:10,000 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 59 predicate places. [2023-08-26 19:19:10,000 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 146 transitions, 1276 flow [2023-08-26 19:19:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 157.10714285714286) internal successors, (4399), 28 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states have 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:19:10,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:19:10,001 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 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:19:10,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-26 19:19:10,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-26 19:19:10,208 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:19:10,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:19:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1908852983, now seen corresponding path program 1 times [2023-08-26 19:19:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:19:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487639054] [2023-08-26 19:19:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:19:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:19:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:19:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:19:10,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:19:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487639054] [2023-08-26 19:19:10,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487639054] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:19:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140175078] [2023-08-26 19:19:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:19:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:19:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:19:10,573 INFO L229 MonitoredProcess]: Starting monitored process 23 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:19:10,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-26 19:19:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:19:10,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:19:10,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:19:10,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:19:10,813 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:19:10,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:19:10,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:10,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:10,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-26 19:19:10,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-08-26 19:19:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:19:11,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:19:35,747 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_127| Int) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_127|) (< |v_t_funThread2of2ForFork0_~i~0#1_127| 1) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1667) |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_127| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-26 19:19:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:19:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140175078] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:19:35,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:19:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-08-26 19:19:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769366173] [2023-08-26 19:19:35,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:19:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:19:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:19:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:19:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=321, Unknown=12, NotChecked=38, Total=462 [2023-08-26 19:19:35,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 607 [2023-08-26 19:19:35,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 146 transitions, 1276 flow. Second operand has 22 states, 22 states have (on average 182.6818181818182) internal successors, (4019), 22 states have internal predecessors, (4019), 0 states have call successors, (0), 0 states have 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:19:35,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:19:35,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 607 [2023-08-26 19:19:35,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:19:42,094 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 36 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:19:45,961 INFO L124 PetriNetUnfolderBase]: 568/1327 cut-off events. [2023-08-26 19:19:45,961 INFO L125 PetriNetUnfolderBase]: For 8332/8340 co-relation queries the response was YES. [2023-08-26 19:19:45,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 1327 events. 568/1327 cut-off events. For 8332/8340 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8780 event pairs, 143 based on Foata normal form. 9/1230 useless extension candidates. Maximal degree in co-relation 6227. Up to 813 conditions per place. [2023-08-26 19:19:45,967 INFO L140 encePairwiseOnDemand]: 594/607 looper letters, 144 selfloop transitions, 34 changer transitions 17/202 dead transitions. [2023-08-26 19:19:45,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 202 transitions, 2078 flow [2023-08-26 19:19:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 19:19:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 19:19:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2075 transitions. [2023-08-26 19:19:45,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3107683091208627 [2023-08-26 19:19:45,969 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2075 transitions. [2023-08-26 19:19:45,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2075 transitions. [2023-08-26 19:19:45,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:19:45,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2075 transitions. [2023-08-26 19:19:45,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have 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:19:45,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 607.0) internal successors, (7284), 12 states have internal predecessors, (7284), 0 states have call successors, (0), 0 states have 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:19:45,973 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 607.0) internal successors, (7284), 12 states have internal predecessors, (7284), 0 states have call successors, (0), 0 states have 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:19:45,973 INFO L175 Difference]: Start difference. First operand has 161 places, 146 transitions, 1276 flow. Second operand 11 states and 2075 transitions. [2023-08-26 19:19:45,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 202 transitions, 2078 flow [2023-08-26 19:19:45,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 202 transitions, 1939 flow, removed 48 selfloop flow, removed 10 redundant places. [2023-08-26 19:19:45,987 INFO L231 Difference]: Finished difference. Result has 165 places, 156 transitions, 1338 flow [2023-08-26 19:19:45,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1338, PETRI_PLACES=165, PETRI_TRANSITIONS=156} [2023-08-26 19:19:45,988 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 63 predicate places. [2023-08-26 19:19:45,988 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 156 transitions, 1338 flow [2023-08-26 19:19:45,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 182.6818181818182) internal successors, (4019), 22 states have internal predecessors, (4019), 0 states have call successors, (0), 0 states have 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:19:45,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:19:45,988 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 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:19:45,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-26 19:19:46,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:19:46,189 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:19:46,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:19:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1394348067, now seen corresponding path program 2 times [2023-08-26 19:19:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:19:46,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172567993] [2023-08-26 19:19:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:19:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:19:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:19:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:19:49,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:19:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172567993] [2023-08-26 19:19:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172567993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:19:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324521112] [2023-08-26 19:19:49,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:19:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:19:49,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:19:49,837 INFO L229 MonitoredProcess]: Starting monitored process 24 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:19:49,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-26 19:19:49,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:19:49,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:19:50,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:19:50,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:19:50,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:19:50,103 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:19:50,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:19:50,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:50,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-26 19:19:50,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-08-26 19:19:50,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:19:50,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:19:51,114 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_129| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_129|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) (+ (- 1) |c_t_funThread1of2ForFork0_#t~mem39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_129| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_129| 1))) is different from false [2023-08-26 19:19:51,126 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_129| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_129|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_129| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_129| 1))) is different from false [2023-08-26 19:19:51,153 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_129| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_129|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) |c_t_funThread1of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_129| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_129| 1))) is different from false [2023-08-26 19:19:53,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_129| Int) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_129|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_129| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_129| 1))) is different from false [2023-08-26 19:19:53,237 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_129| Int) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_129|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1763))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_129| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_129| 1))) is different from false [2023-08-26 19:19:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 19:19:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324521112] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:19:53,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:19:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 9] total 28 [2023-08-26 19:19:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410076915] [2023-08-26 19:19:53,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:19:53,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-26 19:19:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:19:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-26 19:19:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=488, Unknown=7, NotChecked=250, Total=870 [2023-08-26 19:19:53,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 607 [2023-08-26 19:19:53,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 156 transitions, 1338 flow. Second operand has 30 states, 30 states have (on average 153.1) internal successors, (4593), 30 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have 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:19:53,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:19:53,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 607 [2023-08-26 19:19:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:19:58,006 INFO L124 PetriNetUnfolderBase]: 1027/2335 cut-off events. [2023-08-26 19:19:58,007 INFO L125 PetriNetUnfolderBase]: For 14751/14759 co-relation queries the response was YES. [2023-08-26 19:19:58,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11061 conditions, 2335 events. 1027/2335 cut-off events. For 14751/14759 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17849 event pairs, 123 based on Foata normal form. 38/2198 useless extension candidates. Maximal degree in co-relation 11013. Up to 386 conditions per place. [2023-08-26 19:19:58,017 INFO L140 encePairwiseOnDemand]: 589/607 looper letters, 63 selfloop transitions, 7 changer transitions 291/365 dead transitions. [2023-08-26 19:19:58,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 365 transitions, 4057 flow [2023-08-26 19:19:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 19:19:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 19:19:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4256 transitions. [2023-08-26 19:19:58,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2596863750076271 [2023-08-26 19:19:58,021 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4256 transitions. [2023-08-26 19:19:58,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4256 transitions. [2023-08-26 19:19:58,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:19:58,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4256 transitions. [2023-08-26 19:19:58,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 157.62962962962962) internal successors, (4256), 27 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have 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:19:58,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 607.0) internal successors, (16996), 28 states have internal predecessors, (16996), 0 states have call successors, (0), 0 states have 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:19:58,032 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 607.0) internal successors, (16996), 28 states have internal predecessors, (16996), 0 states have call successors, (0), 0 states have 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:19:58,032 INFO L175 Difference]: Start difference. First operand has 165 places, 156 transitions, 1338 flow. Second operand 27 states and 4256 transitions. [2023-08-26 19:19:58,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 365 transitions, 4057 flow [2023-08-26 19:19:58,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 365 transitions, 3869 flow, removed 43 selfloop flow, removed 8 redundant places. [2023-08-26 19:19:58,056 INFO L231 Difference]: Finished difference. Result has 187 places, 74 transitions, 547 flow [2023-08-26 19:19:58,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=547, PETRI_PLACES=187, PETRI_TRANSITIONS=74} [2023-08-26 19:19:58,056 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 85 predicate places. [2023-08-26 19:19:58,056 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 74 transitions, 547 flow [2023-08-26 19:19:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 153.1) internal successors, (4593), 30 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have 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:19:58,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:19:58,057 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 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:19:58,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-26 19:19:58,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:19:58,257 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:19:58,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:19:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 408609693, now seen corresponding path program 1 times [2023-08-26 19:19:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:19:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692713593] [2023-08-26 19:19:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:19:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:19:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:19:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:19:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:19:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692713593] [2023-08-26 19:19:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692713593] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:19:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031753187] [2023-08-26 19:19:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:19:58,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:19:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:19:58,626 INFO L229 MonitoredProcess]: Starting monitored process 25 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:19:58,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-26 19:19:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:19:58,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 19:19:58,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:19:58,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:19:58,887 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:19:58,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:19:58,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:58,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:19:58,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-26 19:19:59,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-08-26 19:19:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:19:59,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:20:19,908 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_138| Int) (v_ArrVal_1861 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_138|) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1861) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_138| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_138| 1))) is different from false [2023-08-26 19:20:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:20:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031753187] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:20:20,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:20:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-08-26 19:20:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529391034] [2023-08-26 19:20:20,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:20:20,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:20:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:20:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=322, Unknown=11, NotChecked=38, Total=462 [2023-08-26 19:20:20,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 607 [2023-08-26 19:20:20,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 74 transitions, 547 flow. Second operand has 22 states, 22 states have (on average 182.77272727272728) internal successors, (4021), 22 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have 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:20:20,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:20,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 607 [2023-08-26 19:20:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:20:22,448 INFO L124 PetriNetUnfolderBase]: 72/230 cut-off events. [2023-08-26 19:20:22,448 INFO L125 PetriNetUnfolderBase]: For 1157/1163 co-relation queries the response was YES. [2023-08-26 19:20:22,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 230 events. 72/230 cut-off events. For 1157/1163 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 924 event pairs, 17 based on Foata normal form. 9/239 useless extension candidates. Maximal degree in co-relation 1062. Up to 90 conditions per place. [2023-08-26 19:20:22,449 INFO L140 encePairwiseOnDemand]: 597/607 looper letters, 61 selfloop transitions, 21 changer transitions 3/89 dead transitions. [2023-08-26 19:20:22,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 89 transitions, 826 flow [2023-08-26 19:20:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 19:20:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 19:20:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1665 transitions. [2023-08-26 19:20:22,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30477759472817134 [2023-08-26 19:20:22,451 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1665 transitions. [2023-08-26 19:20:22,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1665 transitions. [2023-08-26 19:20:22,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:20:22,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1665 transitions. [2023-08-26 19:20:22,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have 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:20:22,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:20:22,456 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 607.0) internal successors, (6070), 10 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have 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:20:22,457 INFO L175 Difference]: Start difference. First operand has 187 places, 74 transitions, 547 flow. Second operand 9 states and 1665 transitions. [2023-08-26 19:20:22,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 89 transitions, 826 flow [2023-08-26 19:20:22,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 89 transitions, 722 flow, removed 24 selfloop flow, removed 32 redundant places. [2023-08-26 19:20:22,460 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 538 flow [2023-08-26 19:20:22,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=538, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2023-08-26 19:20:22,461 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-08-26 19:20:22,461 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 538 flow [2023-08-26 19:20:22,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 182.77272727272728) internal successors, (4021), 22 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have 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:20:22,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:22,461 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:20:22,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-26 19:20:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-26 19:20:22,662 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:20:22,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1710715747, now seen corresponding path program 2 times [2023-08-26 19:20:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512506836] [2023-08-26 19:20:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:20:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:20:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512506836] [2023-08-26 19:20:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512506836] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:20:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029130092] [2023-08-26 19:20:23,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:20:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:20:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:20:23,041 INFO L229 MonitoredProcess]: Starting monitored process 26 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:20:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-26 19:20:23,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:20:23,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:20:23,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-26 19:20:23,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:20:23,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:20:23,328 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:20:23,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:20:23,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:20:23,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:20:23,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-26 19:20:23,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-08-26 19:20:23,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:20:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:20:23,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:20:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029130092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:20:23,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:20:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-08-26 19:20:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442850186] [2023-08-26 19:20:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:20:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 19:20:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 19:20:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-08-26 19:20:23,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 607 [2023-08-26 19:20:23,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 538 flow. Second operand has 9 states, 9 states have (on average 182.44444444444446) internal successors, (1642), 9 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have 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:20:23,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:23,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 607 [2023-08-26 19:20:23,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:20:23,785 INFO L124 PetriNetUnfolderBase]: 65/209 cut-off events. [2023-08-26 19:20:23,785 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2023-08-26 19:20:23,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 209 events. 65/209 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 811 event pairs, 17 based on Foata normal form. 6/215 useless extension candidates. Maximal degree in co-relation 910. Up to 57 conditions per place. [2023-08-26 19:20:23,786 INFO L140 encePairwiseOnDemand]: 599/607 looper letters, 0 selfloop transitions, 0 changer transitions 87/87 dead transitions. [2023-08-26 19:20:23,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 87 transitions, 778 flow [2023-08-26 19:20:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 19:20:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 19:20:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1478 transitions. [2023-08-26 19:20:23,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3043657331136738 [2023-08-26 19:20:23,788 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1478 transitions. [2023-08-26 19:20:23,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1478 transitions. [2023-08-26 19:20:23,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:20:23,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1478 transitions. [2023-08-26 19:20:23,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 184.75) internal successors, (1478), 8 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have 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:20:23,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 607.0) internal successors, (5463), 9 states have internal predecessors, (5463), 0 states have call successors, (0), 0 states have 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:20:23,793 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 607.0) internal successors, (5463), 9 states have internal predecessors, (5463), 0 states have call successors, (0), 0 states have 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:20:23,793 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 538 flow. Second operand 8 states and 1478 transitions. [2023-08-26 19:20:23,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 87 transitions, 778 flow [2023-08-26 19:20:23,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 87 transitions, 725 flow, removed 2 selfloop flow, removed 11 redundant places. [2023-08-26 19:20:23,796 INFO L231 Difference]: Finished difference. Result has 99 places, 0 transitions, 0 flow [2023-08-26 19:20:23,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=607, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=99, PETRI_TRANSITIONS=0} [2023-08-26 19:20:23,797 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2023-08-26 19:20:23,797 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 0 transitions, 0 flow [2023-08-26 19:20:23,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 182.44444444444446) internal successors, (1642), 9 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have 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:20:23,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 48 remaining) [2023-08-26 19:20:23,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 48 remaining) [2023-08-26 19:20:23,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 48 remaining) [2023-08-26 19:20:23,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (35 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 48 remaining) [2023-08-26 19:20:23,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 48 remaining) [2023-08-26 19:20:23,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (14 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 48 remaining) [2023-08-26 19:20:23,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (9 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (6 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 48 remaining) [2023-08-26 19:20:23,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 48 remaining) [2023-08-26 19:20:23,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-26 19:20:24,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-26 19:20:24,007 INFO L445 BasicCegarLoop]: Path program histogram: [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:20:24,008 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 19:20:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,045 INFO L124 PetriNetUnfolderBase]: 80/522 cut-off events. [2023-08-26 19:20:24,045 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:20:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 522 events. 80/522 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2395 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 320. Up to 12 conditions per place. [2023-08-26 19:20:24,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,050 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:20:24,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,050 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 315 transitions, 648 flow [2023-08-26 19:20:24,094 INFO L124 PetriNetUnfolderBase]: 80/522 cut-off events. [2023-08-26 19:20:24,094 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:20:24,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 522 events. 80/522 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2395 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 320. Up to 12 conditions per place. [2023-08-26 19:20:24,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 48960 [2023-08-26 19:20:28,784 INFO L134 LiptonReduction]: Checked pairs total: 98210 [2023-08-26 19:20:28,784 INFO L136 LiptonReduction]: Total number of compositions: 293 [2023-08-26 19:20:28,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 19:20:28,785 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;@38bddf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:20:28,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 19:20:28,794 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:20:28,794 INFO L124 PetriNetUnfolderBase]: 39/156 cut-off events. [2023-08-26 19:20:28,794 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 19:20:28,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:28,794 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 19:20:28,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:20:28,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1500723201, now seen corresponding path program 1 times [2023-08-26 19:20:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820778458] [2023-08-26 19:20:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:20:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820778458] [2023-08-26 19:20:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820778458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:20:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:20:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:20:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265421157] [2023-08-26 19:20:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:20:28,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:20:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:20:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:20:28,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 608 [2023-08-26 19:20:28,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 135 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:20:28,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:28,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 608 [2023-08-26 19:20:28,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:20:30,532 INFO L124 PetriNetUnfolderBase]: 22825/38051 cut-off events. [2023-08-26 19:20:30,533 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-26 19:20:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71674 conditions, 38051 events. 22825/38051 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 320901 event pairs, 21546 based on Foata normal form. 3152/29199 useless extension candidates. Maximal degree in co-relation 30523. Up to 33499 conditions per place. [2023-08-26 19:20:30,611 INFO L140 encePairwiseOnDemand]: 565/608 looper letters, 47 selfloop transitions, 2 changer transitions 31/96 dead transitions. [2023-08-26 19:20:30,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 358 flow [2023-08-26 19:20:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:20:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:20:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2023-08-26 19:20:30,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48739035087719296 [2023-08-26 19:20:30,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 889 transitions. [2023-08-26 19:20:30,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 889 transitions. [2023-08-26 19:20:30,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:20:30,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 889 transitions. [2023-08-26 19:20:30,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have 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:20:30,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 608.0) internal successors, (2432), 4 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have 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:20:30,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 608.0) internal successors, (2432), 4 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have 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:20:30,614 INFO L175 Difference]: Start difference. First operand has 102 places, 135 transitions, 288 flow. Second operand 3 states and 889 transitions. [2023-08-26 19:20:30,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 358 flow [2023-08-26 19:20:30,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:20:30,616 INFO L231 Difference]: Finished difference. Result has 97 places, 65 transitions, 152 flow [2023-08-26 19:20:30,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=97, PETRI_TRANSITIONS=65} [2023-08-26 19:20:30,616 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -5 predicate places. [2023-08-26 19:20:30,616 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 65 transitions, 152 flow [2023-08-26 19:20:30,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:20:30,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:30,616 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:20:30,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-26 19:20:30,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:20:30,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1472231309, now seen corresponding path program 1 times [2023-08-26 19:20:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114084601] [2023-08-26 19:20:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:20:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114084601] [2023-08-26 19:20:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114084601] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:20:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909391811] [2023-08-26 19:20:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:20:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:20:30,641 INFO L229 MonitoredProcess]: Starting monitored process 27 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:20:30,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-26 19:20:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:30,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:20:30,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:20:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:30,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:20:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909391811] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:20:30,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:20:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:20:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883977139] [2023-08-26 19:20:30,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:20:30,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:20:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:20:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:20:30,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 608 [2023-08-26 19:20:30,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 65 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:20:30,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:30,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 608 [2023-08-26 19:20:30,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:20:31,179 INFO L124 PetriNetUnfolderBase]: 4492/7777 cut-off events. [2023-08-26 19:20:31,179 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-26 19:20:31,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 7777 events. 4492/7777 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 54613 event pairs, 4275 based on Foata normal form. 0/5054 useless extension candidates. Maximal degree in co-relation 14662. Up to 6803 conditions per place. [2023-08-26 19:20:31,194 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 47 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-26 19:20:31,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 268 flow [2023-08-26 19:20:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:20:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:20:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1603 transitions. [2023-08-26 19:20:31,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4394188596491228 [2023-08-26 19:20:31,196 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1603 transitions. [2023-08-26 19:20:31,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1603 transitions. [2023-08-26 19:20:31,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:20:31,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1603 transitions. [2023-08-26 19:20:31,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have 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:20:31,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 608.0) internal successors, (4256), 7 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have 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:20:31,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 608.0) internal successors, (4256), 7 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have 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:20:31,200 INFO L175 Difference]: Start difference. First operand has 97 places, 65 transitions, 152 flow. Second operand 6 states and 1603 transitions. [2023-08-26 19:20:31,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 268 flow [2023-08-26 19:20:31,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 262 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 19:20:31,201 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 182 flow [2023-08-26 19:20:31,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-08-26 19:20:31,202 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -26 predicate places. [2023-08-26 19:20:31,202 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 182 flow [2023-08-26 19:20:31,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:20:31,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:31,202 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 19:20:31,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-26 19:20:31,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-26 19:20:31,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:20:31,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash -579648257, now seen corresponding path program 2 times [2023-08-26 19:20:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958088343] [2023-08-26 19:20:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:20:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958088343] [2023-08-26 19:20:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958088343] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:20:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900709179] [2023-08-26 19:20:31,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:20:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:20:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:20:31,464 INFO L229 MonitoredProcess]: Starting monitored process 28 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:20:31,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-26 19:20:31,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:20:31,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:20:31,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:20:31,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:20:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:31,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:20:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 19:20:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900709179] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:20:31,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:20:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 19:20:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057728022] [2023-08-26 19:20:31,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:20:31,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 19:20:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 19:20:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 19:20:31,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 608 [2023-08-26 19:20:31,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 182 flow. Second operand has 12 states, 12 states have (on average 259.3333333333333) internal successors, (3112), 12 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have 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:20:31,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:31,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 608 [2023-08-26 19:20:31,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:20:32,119 INFO L124 PetriNetUnfolderBase]: 4492/7783 cut-off events. [2023-08-26 19:20:32,119 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-26 19:20:32,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14704 conditions, 7783 events. 4492/7783 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 54530 event pairs, 4275 based on Foata normal form. 6/5067 useless extension candidates. Maximal degree in co-relation 14645. Up to 6803 conditions per place. [2023-08-26 19:20:32,137 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 47 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-08-26 19:20:32,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 334 flow [2023-08-26 19:20:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:20:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:20:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3160 transitions. [2023-08-26 19:20:32,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331140350877193 [2023-08-26 19:20:32,139 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3160 transitions. [2023-08-26 19:20:32,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3160 transitions. [2023-08-26 19:20:32,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:20:32,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3160 transitions. [2023-08-26 19:20:32,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 263.3333333333333) internal successors, (3160), 12 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have 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:20:32,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 608.0) internal successors, (7904), 13 states have internal predecessors, (7904), 0 states have call successors, (0), 0 states have 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:20:32,144 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 608.0) internal successors, (7904), 13 states have internal predecessors, (7904), 0 states have call successors, (0), 0 states have 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:20:32,144 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 182 flow. Second operand 12 states and 3160 transitions. [2023-08-26 19:20:32,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 334 flow [2023-08-26 19:20:32,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 74 transitions, 320 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:20:32,146 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 252 flow [2023-08-26 19:20:32,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2023-08-26 19:20:32,146 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -10 predicate places. [2023-08-26 19:20:32,146 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 252 flow [2023-08-26 19:20:32,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 259.3333333333333) internal successors, (3112), 12 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have 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:20:32,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:32,146 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 19:20:32,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-26 19:20:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:20:32,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:20:32,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1366610047, now seen corresponding path program 3 times [2023-08-26 19:20:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985748952] [2023-08-26 19:20:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:20:32,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 19:20:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:20:32,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 19:20:32,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 19:20:32,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 19:20:32,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-26 19:20:32,375 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 19:20:32,375 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 19:20:32,375 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 19:20:32,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-26 19:20:32,409 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 19:20:32,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,505 INFO L124 PetriNetUnfolderBase]: 117/763 cut-off events. [2023-08-26 19:20:32,506 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2023-08-26 19:20:32,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 763 events. 117/763 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3821 event pairs, 1 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 530. Up to 16 conditions per place. [2023-08-26 19:20:32,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,527 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:20:32,527 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,527 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 402 transitions, 834 flow [2023-08-26 19:20:32,622 INFO L124 PetriNetUnfolderBase]: 117/763 cut-off events. [2023-08-26 19:20:32,622 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2023-08-26 19:20:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 763 events. 117/763 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3821 event pairs, 1 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 530. Up to 16 conditions per place. [2023-08-26 19:20:32,665 INFO L119 LiptonReduction]: Number of co-enabled transitions 95880 [2023-08-26 19:20:38,452 INFO L134 LiptonReduction]: Checked pairs total: 193301 [2023-08-26 19:20:38,452 INFO L136 LiptonReduction]: Total number of compositions: 375 [2023-08-26 19:20:38,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:20:38,453 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;@38bddf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:20:38,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-08-26 19:20:38,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:20:38,454 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-08-26 19:20:38,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:20:38,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:20:38,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:20:38,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-26 19:20:38,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:20:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2957482, now seen corresponding path program 1 times [2023-08-26 19:20:38,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:20:38,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050198889] [2023-08-26 19:20:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:20:38,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:20:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:20:38,469 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:20:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:20:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050198889] [2023-08-26 19:20:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050198889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:20:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:20:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:20:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863340189] [2023-08-26 19:20:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:20:38,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:20:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:20:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:20:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:20:38,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 777 [2023-08-26 19:20:38,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 175 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have 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:20:38,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:20:38,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 777 [2023-08-26 19:20:38,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:52,062 INFO L124 PetriNetUnfolderBase]: 757855/1080531 cut-off events. [2023-08-26 19:21:52,062 INFO L125 PetriNetUnfolderBase]: For 5919/5919 co-relation queries the response was YES. [2023-08-26 19:21:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079844 conditions, 1080531 events. 757855/1080531 cut-off events. For 5919/5919 co-relation queries the response was YES. Maximal size of possible extension queue 34235. Compared 10255662 event pairs, 730010 based on Foata normal form. 93714/790766 useless extension candidates. Maximal degree in co-relation 243362. Up to 995663 conditions per place. [2023-08-26 19:21:59,853 INFO L140 encePairwiseOnDemand]: 722/777 looper letters, 95 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2023-08-26 19:21:59,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 472 flow [2023-08-26 19:21:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2023-08-26 19:21:59,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877734877734878 [2023-08-26 19:21:59,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1137 transitions. [2023-08-26 19:21:59,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1137 transitions. [2023-08-26 19:21:59,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:59,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1137 transitions. [2023-08-26 19:21:59,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:21:59,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have 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:21:59,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have 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:21:59,866 INFO L175 Difference]: Start difference. First operand has 132 places, 175 transitions, 380 flow. Second operand 3 states and 1137 transitions. [2023-08-26 19:21:59,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 472 flow [2023-08-26 19:21:59,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:21:59,873 INFO L231 Difference]: Finished difference. Result has 125 places, 124 transitions, 288 flow [2023-08-26 19:21:59,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=125, PETRI_TRANSITIONS=124} [2023-08-26 19:21:59,874 INFO L281 CegarLoopForPetriNet]: 132 programPoint places, -7 predicate places. [2023-08-26 19:21:59,874 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 124 transitions, 288 flow [2023-08-26 19:21:59,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have 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:21:59,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:59,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 19:21:59,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-26 19:21:59,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-26 19:21:59,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 91638562, now seen corresponding path program 1 times [2023-08-26 19:21:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893013148] [2023-08-26 19:21:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:59,898 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:21:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893013148] [2023-08-26 19:21:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893013148] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677904366] [2023-08-26 19:21:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:59,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:59,905 INFO L229 MonitoredProcess]: Starting monitored process 29 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:21:59,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-26 19:22:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:22:00,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:22:00,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:00,099 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:00,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:00,112 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:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677904366] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:00,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:22:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451090945] [2023-08-26 19:22:00,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:00,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:22:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:22:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:22:00,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 777 [2023-08-26 19:22:00,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 124 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 330.2857142857143) internal successors, (2312), 7 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:00,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:00,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 777 [2023-08-26 19:22:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-26 19:23:12,963 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:23:12,964 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:23:13,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-08-26 19:23:14,164 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 19:23:14,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 19:23:14,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 59 remaining) [2023-08-26 19:23:14,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-26 19:23:14,919 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 19:23:14,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-08-26 19:23:14,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (34 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (32 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (22 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2023-08-26 19:23:14,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (14 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-08-26 19:23:14,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (6 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-08-26 19:23:14,923 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-08-26 19:23:14,923 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-26 19:23:14,923 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 19:23:14,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-26 19:23:14,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:23:14,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:23:14 BasicIcfg [2023-08-26 19:23:14,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:23:14,929 INFO L158 Benchmark]: Toolchain (without parser) took 754257.20ms. Allocated memory was 360.7MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 335.1MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 8.5GB. Max. memory is 16.0GB. [2023-08-26 19:23:14,929 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 360.7MB. Free memory is still 337.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:23:14,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.49ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 305.4MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 19:23:14,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.67ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 302.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:23:14,929 INFO L158 Benchmark]: Boogie Preprocessor took 55.35ms. Allocated memory is still 360.7MB. Free memory was 302.8MB in the beginning and 300.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 19:23:14,930 INFO L158 Benchmark]: RCFGBuilder took 520.22ms. Allocated memory is still 360.7MB. Free memory was 300.1MB in the beginning and 329.1MB in the end (delta: -29.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.0GB. [2023-08-26 19:23:14,930 INFO L158 Benchmark]: TraceAbstraction took 753000.69ms. Allocated memory was 360.7MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 328.2MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 8.5GB. Max. memory is 16.0GB. [2023-08-26 19:23:14,931 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.21ms. Allocated memory is still 360.7MB. Free memory is still 337.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 624.49ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 305.4MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.67ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 302.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.35ms. Allocated memory is still 360.7MB. Free memory was 302.8MB in the beginning and 300.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 520.22ms. Allocated memory is still 360.7MB. Free memory was 300.1MB in the beginning and 329.1MB in the end (delta: -29.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.0GB. * TraceAbstraction took 753000.69ms. Allocated memory was 360.7MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 328.2MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 8.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 198 PlacesBefore, 70 PlacesAfterwards, 228 TransitionsBefore, 92 TransitionsAfterwards, 16320 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 139 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 24 ConcurrentYvCompositions, 8 ChoiceCompositions, 217 TotalNumberOfCompositions, 30848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15875, independent: 15518, independent conditional: 0, independent unconditional: 15518, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8996, independent: 8899, independent conditional: 0, independent unconditional: 8899, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15875, independent: 6619, independent conditional: 0, independent unconditional: 6619, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 8996, unknown conditional: 0, unknown unconditional: 8996] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 403, Positive conditional cache size: 0, Positive unconditional cache size: 403, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 194 PlacesBefore, 69 PlacesAfterwards, 223 TransitionsBefore, 91 TransitionsAfterwards, 16320 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 147 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 214 TotalNumberOfCompositions, 30163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14722, independent: 14383, independent conditional: 0, independent unconditional: 14383, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8940, independent: 8857, independent conditional: 0, independent unconditional: 8857, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14722, independent: 5526, independent conditional: 0, independent unconditional: 5526, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 8940, unknown conditional: 0, unknown unconditional: 8940] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 352, Positive conditional cache size: 0, Positive unconditional cache size: 352, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 272 PlacesBefore, 102 PlacesAfterwards, 315 TransitionsBefore, 134 TransitionsAfterwards, 48960 CoEnabledTransitionPairs, 5 FixpointIterations, 38 TrivialSequentialCompositions, 201 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 37 ConcurrentYvCompositions, 11 ChoiceCompositions, 292 TotalNumberOfCompositions, 88602 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42995, independent: 42516, independent conditional: 0, independent unconditional: 42516, dependent: 479, dependent conditional: 0, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 25971, independent: 25814, independent conditional: 0, independent unconditional: 25814, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42995, independent: 16702, independent conditional: 0, independent unconditional: 16702, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 25971, unknown conditional: 0, unknown unconditional: 25971] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1069, Positive conditional cache size: 0, Positive unconditional cache size: 1069, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 272 PlacesBefore, 102 PlacesAfterwards, 315 TransitionsBefore, 135 TransitionsAfterwards, 48960 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 206 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 36 ConcurrentYvCompositions, 10 ChoiceCompositions, 293 TotalNumberOfCompositions, 98210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45333, independent: 44764, independent conditional: 0, independent unconditional: 44764, dependent: 569, dependent conditional: 0, dependent unconditional: 569, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 26541, independent: 26351, independent conditional: 0, independent unconditional: 26351, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45333, independent: 18413, independent conditional: 0, independent unconditional: 18413, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 26541, unknown conditional: 0, unknown unconditional: 26541] , Statistics on independence cache: Total cache size (in pairs): 1541, Positive cache size: 1470, Positive conditional cache size: 0, Positive unconditional cache size: 1470, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 346 PlacesBefore, 132 PlacesAfterwards, 402 TransitionsBefore, 175 TransitionsAfterwards, 95880 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 276 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 45 ConcurrentYvCompositions, 13 ChoiceCompositions, 375 TotalNumberOfCompositions, 193301 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98668, independent: 97905, independent conditional: 0, independent unconditional: 97905, dependent: 763, dependent conditional: 0, dependent unconditional: 763, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 51540, independent: 51362, independent conditional: 0, independent unconditional: 51362, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98668, independent: 46543, independent conditional: 0, independent unconditional: 46543, dependent: 585, dependent conditional: 0, dependent unconditional: 585, unknown: 51540, unknown conditional: 0, unknown unconditional: 51540] , Statistics on independence cache: Total cache size (in pairs): 2813, Positive cache size: 2742, Positive conditional cache size: 0, Positive unconditional cache size: 2742, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 268 locations, 38 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 340/376 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 340 locations, 49 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: 569.2s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 354.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 214 mSolverCounterUnknown, 3754 SdHoareTripleChecker+Valid, 109.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3754 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 107.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4174 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 904 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10829 IncrementalHoareTripleChecker+Invalid, 16121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 904 mSolverCounterUnsat, 15 mSDtfsCounter, 10829 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1413 GetRequests, 816 SyntacticMatches, 50 SemanticMatches, 547 ConstructedPredicates, 32 IntricatePredicates, 3 DeprecatedPredicates, 3584 ImplicationChecksByTransitivity, 402.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1711occurred in iteration=17, InterpolantAutomatonStates: 292, 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.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 202.4s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1144 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1598 ConstructedInterpolants, 444 QuantifiedInterpolants, 46526 SizeOfPredicates, 162 NumberOfNonLiveVariables, 4855 ConjunctsInSsa, 673 ConjunctsInUnsatCore, 64 InterpolantComputations, 8 PerfectInterpolantSequences, 2987/3202 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 412 locations, 60 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: 162.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 156.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 268 locations, 38 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: 4.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 324 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 340 locations, 49 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 56/89 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