/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 14:08:15,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 14:08:15,815 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 14:08:15,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 14:08:15,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 14:08:15,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 14:08:15,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 14:08:15,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 14:08:15,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 14:08:15,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 14:08:15,855 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 14:08:15,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 14:08:15,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 14:08:15,856 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 14:08:15,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 14:08:15,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 14:08:15,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 14:08:15,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 14:08:15,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 14:08:15,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 14:08:15,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 14:08:15,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 14:08:15,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 14:08:15,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 14:08:15,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 14:08:15,866 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 14:08:15,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 14:08:15,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 14:08:15,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 14:08:15,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 14:08:15,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 14:08:15,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 14:08:15,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 14:08:15,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 14:08:15,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 14:08:15,871 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 14:08:16,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 14:08:16,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 14:08:16,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 14:08:16,211 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 14:08:16,211 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 14:08:16,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-26 14:08:17,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 14:08:17,714 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 14:08:17,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-26 14:08:17,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e51076a/be82e827ab8a4044b57c467b8c7642bf/FLAG0c557c14e [2023-08-26 14:08:17,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e51076a/be82e827ab8a4044b57c467b8c7642bf [2023-08-26 14:08:17,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 14:08:17,760 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 14:08:17,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 14:08:17,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 14:08:17,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 14:08:17,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:08:17" (1/1) ... [2023-08-26 14:08:17,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@969eb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:17, skipping insertion in model container [2023-08-26 14:08:17,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:08:17" (1/1) ... [2023-08-26 14:08:17,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 14:08:18,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 14:08:18,235 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 14:08:18,260 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 14:08:18,261 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 14:08:18,267 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 14:08:18,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 14:08:18,361 INFO L206 MainTranslator]: Completed translation [2023-08-26 14:08:18,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18 WrapperNode [2023-08-26 14:08:18,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 14:08:18,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 14:08:18,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 14:08:18,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 14:08:18,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,437 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-08-26 14:08:18,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 14:08:18,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 14:08:18,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 14:08:18,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 14:08:18,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 14:08:18,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 14:08:18,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 14:08:18,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 14:08:18,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (1/1) ... [2023-08-26 14:08:18,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 14:08:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:08:18,538 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 14:08:18,549 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 14:08:18,577 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 14:08:18,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 14:08:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 14:08:18,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 14:08:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 14:08:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 14:08:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 14:08:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 14:08:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 14:08:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 14:08:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 14:08:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 14:08:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 14:08:18,580 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 14:08:18,762 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 14:08:18,764 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 14:08:19,183 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 14:08:19,191 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 14:08:19,191 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 14:08:19,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:08:19 BoogieIcfgContainer [2023-08-26 14:08:19,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 14:08:19,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 14:08:19,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 14:08:19,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 14:08:19,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:08:17" (1/3) ... [2023-08-26 14:08:19,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b1907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:08:19, skipping insertion in model container [2023-08-26 14:08:19,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:18" (2/3) ... [2023-08-26 14:08:19,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b1907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:08:19, skipping insertion in model container [2023-08-26 14:08:19,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:08:19" (3/3) ... [2023-08-26 14:08:19,208 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-26 14:08:19,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 14:08:19,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 14:08:19,224 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 14:08:19,336 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 14:08:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 14:08:19,479 INFO L124 PetriNetUnfolderBase]: 15/280 cut-off events. [2023-08-26 14:08:19,479 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 14:08:19,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 280 events. 15/280 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 14:08:19,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 14:08:19,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 271 transitions, 551 flow [2023-08-26 14:08:19,513 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 14:08:19,529 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 14:08:19,535 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 14:08:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 551 flow [2023-08-26 14:08:19,593 INFO L124 PetriNetUnfolderBase]: 15/271 cut-off events. [2023-08-26 14:08:19,593 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 14:08:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 271 events. 15/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 605 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 14:08:19,607 INFO L119 LiptonReduction]: Number of co-enabled transitions 18460 [2023-08-26 14:08:31,317 INFO L134 LiptonReduction]: Checked pairs total: 58098 [2023-08-26 14:08:31,318 INFO L136 LiptonReduction]: Total number of compositions: 364 [2023-08-26 14:08:31,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 14:08:31,334 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;@37b8466a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 14:08:31,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-08-26 14:08:31,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 14:08:31,336 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 14:08:31,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 14:08:31,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:31,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 14:08:31,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:31,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1197, now seen corresponding path program 1 times [2023-08-26 14:08:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904163328] [2023-08-26 14:08:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:31,458 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 14:08:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904163328] [2023-08-26 14:08:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904163328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 14:08:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458420422] [2023-08-26 14:08:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:31,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 14:08:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 14:08:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 14:08:31,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 646 [2023-08-26 14:08:31,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 217 flow. Second operand has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:31,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:31,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 646 [2023-08-26 14:08:31,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:32,145 INFO L124 PetriNetUnfolderBase]: 4013/6423 cut-off events. [2023-08-26 14:08:32,145 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-26 14:08:32,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12628 conditions, 6423 events. 4013/6423 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37134 event pairs, 3493 based on Foata normal form. 0/3205 useless extension candidates. Maximal degree in co-relation 12169. Up to 6135 conditions per place. [2023-08-26 14:08:32,186 INFO L140 encePairwiseOnDemand]: 610/646 looper letters, 61 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-26 14:08:32,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 267 flow [2023-08-26 14:08:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 14:08:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 14:08:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 635 transitions. [2023-08-26 14:08:32,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914860681114551 [2023-08-26 14:08:32,205 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 635 transitions. [2023-08-26 14:08:32,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 635 transitions. [2023-08-26 14:08:32,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:32,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 635 transitions. [2023-08-26 14:08:32,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 317.5) internal successors, (635), 2 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:32,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:32,226 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:32,227 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 217 flow. Second operand 2 states and 635 transitions. [2023-08-26 14:08:32,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 267 flow [2023-08-26 14:08:32,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 14:08:32,234 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 140 flow [2023-08-26 14:08:32,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-26 14:08:32,239 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 14:08:32,239 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 140 flow [2023-08-26 14:08:32,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:32,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:32,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 14:08:32,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 14:08:32,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:32,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1181127, now seen corresponding path program 1 times [2023-08-26 14:08:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591844312] [2023-08-26 14:08:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:32,495 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 14:08:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591844312] [2023-08-26 14:08:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591844312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:32,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549800233] [2023-08-26 14:08:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:32,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:32,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:32,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 14:08:32,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:32,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:32,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 14:08:32,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:33,068 INFO L124 PetriNetUnfolderBase]: 4304/6761 cut-off events. [2023-08-26 14:08:33,069 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:08:33,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13378 conditions, 6761 events. 4304/6761 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37987 event pairs, 3770 based on Foata normal form. 0/3322 useless extension candidates. Maximal degree in co-relation 13375. Up to 6571 conditions per place. [2023-08-26 14:08:33,106 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 60 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 14:08:33,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2023-08-26 14:08:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2023-08-26 14:08:33,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34055727554179566 [2023-08-26 14:08:33,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2023-08-26 14:08:33,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2023-08-26 14:08:33,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:33,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2023-08-26 14:08:33,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,117 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 140 flow. Second operand 3 states and 660 transitions. [2023-08-26 14:08:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2023-08-26 14:08:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 14:08:33,119 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 138 flow [2023-08-26 14:08:33,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-26 14:08:33,120 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 14:08:33,120 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 138 flow [2023-08-26 14:08:33,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:33,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 14:08:33,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 14:08:33,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:33,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1181128, now seen corresponding path program 1 times [2023-08-26 14:08:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259360972] [2023-08-26 14:08:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:33,200 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 14:08:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259360972] [2023-08-26 14:08:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259360972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755976388] [2023-08-26 14:08:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:33,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:33,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:08:33,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 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 14:08:33,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:33,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:08:33,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:33,687 INFO L124 PetriNetUnfolderBase]: 4253/6661 cut-off events. [2023-08-26 14:08:33,687 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:08:33,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13183 conditions, 6661 events. 4253/6661 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 37227 event pairs, 3725 based on Foata normal form. 0/3293 useless extension candidates. Maximal degree in co-relation 13179. Up to 6474 conditions per place. [2023-08-26 14:08:33,723 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 58 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 14:08:33,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 252 flow [2023-08-26 14:08:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2023-08-26 14:08:33,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3364293085655315 [2023-08-26 14:08:33,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2023-08-26 14:08:33,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2023-08-26 14:08:33,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:33,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2023-08-26 14:08:33,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 14:08:33,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,733 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 138 flow. Second operand 3 states and 652 transitions. [2023-08-26 14:08:33,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 252 flow [2023-08-26 14:08:33,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:33,735 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 135 flow [2023-08-26 14:08:33,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-26 14:08:33,736 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:08:33,736 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 135 flow [2023-08-26 14:08:33,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 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 14:08:33,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:33,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:08:33,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 14:08:33,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:33,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090846, now seen corresponding path program 1 times [2023-08-26 14:08:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298706807] [2023-08-26 14:08:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:33,902 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 14:08:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298706807] [2023-08-26 14:08:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298706807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35242831] [2023-08-26 14:08:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:33,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 14:08:33,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:33,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:33,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 14:08:33,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:34,268 INFO L124 PetriNetUnfolderBase]: 3079/4910 cut-off events. [2023-08-26 14:08:34,268 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:08:34,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9727 conditions, 4910 events. 3079/4910 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 26660 event pairs, 2680 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 9723. Up to 4768 conditions per place. [2023-08-26 14:08:34,290 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 57 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-08-26 14:08:34,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 249 flow [2023-08-26 14:08:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-26 14:08:34,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3384932920536636 [2023-08-26 14:08:34,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-26 14:08:34,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-26 14:08:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:34,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-26 14:08:34,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,299 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 135 flow. Second operand 3 states and 656 transitions. [2023-08-26 14:08:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 249 flow [2023-08-26 14:08:34,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:34,301 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 134 flow [2023-08-26 14:08:34,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-26 14:08:34,302 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:08:34,302 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 134 flow [2023-08-26 14:08:34,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:34,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:08:34,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 14:08:34,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:34,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090845, now seen corresponding path program 1 times [2023-08-26 14:08:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718055351] [2023-08-26 14:08:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:34,365 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 14:08:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718055351] [2023-08-26 14:08:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718055351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:34,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:34,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:08:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578993201] [2023-08-26 14:08:34,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:34,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:08:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:08:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:08:34,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 14:08:34,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:34,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 14:08:34,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:34,633 INFO L124 PetriNetUnfolderBase]: 1905/3159 cut-off events. [2023-08-26 14:08:34,634 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:08:34,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 3159 events. 1905/3159 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16660 event pairs, 1635 based on Foata normal form. 0/1997 useless extension candidates. Maximal degree in co-relation 6267. Up to 3062 conditions per place. [2023-08-26 14:08:34,648 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 56 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 14:08:34,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 246 flow [2023-08-26 14:08:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-08-26 14:08:34,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302373581011352 [2023-08-26 14:08:34,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-08-26 14:08:34,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-08-26 14:08:34,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:34,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-08-26 14:08:34,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,657 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 134 flow. Second operand 3 states and 640 transitions. [2023-08-26 14:08:34,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 246 flow [2023-08-26 14:08:34,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:34,659 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 133 flow [2023-08-26 14:08:34,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-08-26 14:08:34,660 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:08:34,660 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 133 flow [2023-08-26 14:08:34,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:34,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:08:34,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 14:08:34,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:34,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062955, now seen corresponding path program 1 times [2023-08-26 14:08:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14226385] [2023-08-26 14:08:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:34,818 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 14:08:34,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14226385] [2023-08-26 14:08:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14226385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:34,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:34,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:34,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948783362] [2023-08-26 14:08:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:34,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 14:08:34,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 14:08:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:35,064 INFO L124 PetriNetUnfolderBase]: 1691/2803 cut-off events. [2023-08-26 14:08:35,065 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 14:08:35,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 2803 events. 1691/2803 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14367 event pairs, 1437 based on Foata normal form. 0/1843 useless extension candidates. Maximal degree in co-relation 5560. Up to 2712 conditions per place. [2023-08-26 14:08:35,075 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 53 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-08-26 14:08:35,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 235 flow [2023-08-26 14:08:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-26 14:08:35,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32972136222910214 [2023-08-26 14:08:35,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-26 14:08:35,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-26 14:08:35,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:35,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-26 14:08:35,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,085 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 133 flow. Second operand 3 states and 639 transitions. [2023-08-26 14:08:35,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 235 flow [2023-08-26 14:08:35,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:35,086 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2023-08-26 14:08:35,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-26 14:08:35,087 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2023-08-26 14:08:35,087 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2023-08-26 14:08:35,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:35,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:08:35,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 14:08:35,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:35,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062954, now seen corresponding path program 1 times [2023-08-26 14:08:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:35,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11702631] [2023-08-26 14:08:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:35,202 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 14:08:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11702631] [2023-08-26 14:08:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11702631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88266878] [2023-08-26 14:08:35,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:35,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:35,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:35,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:35,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:08:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:08:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:35,409 INFO L124 PetriNetUnfolderBase]: 1428/2366 cut-off events. [2023-08-26 14:08:35,409 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 14:08:35,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2366 events. 1428/2366 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11577 event pairs, 1194 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 4691. Up to 2281 conditions per place. [2023-08-26 14:08:35,420 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 14:08:35,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 220 flow [2023-08-26 14:08:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-26 14:08:35,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328173374613003 [2023-08-26 14:08:35,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-26 14:08:35,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-26 14:08:35,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:35,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-26 14:08:35,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,427 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 128 flow. Second operand 3 states and 645 transitions. [2023-08-26 14:08:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 220 flow [2023-08-26 14:08:35,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:35,429 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 121 flow [2023-08-26 14:08:35,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 14:08:35,430 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2023-08-26 14:08:35,430 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 121 flow [2023-08-26 14:08:35,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:35,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:08:35,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 14:08:35,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:35,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062968, now seen corresponding path program 1 times [2023-08-26 14:08:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090188265] [2023-08-26 14:08:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:35,731 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 14:08:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090188265] [2023-08-26 14:08:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090188265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046426182] [2023-08-26 14:08:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:35,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:35,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 646 [2023-08-26 14:08:35,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:35,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 646 [2023-08-26 14:08:35,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:35,958 INFO L124 PetriNetUnfolderBase]: 1367/2307 cut-off events. [2023-08-26 14:08:35,959 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 14:08:35,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2307 events. 1367/2307 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11560 event pairs, 919 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 4541. Up to 2182 conditions per place. [2023-08-26 14:08:35,969 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 54 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 14:08:35,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 255 flow [2023-08-26 14:08:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-26 14:08:35,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37874097007223945 [2023-08-26 14:08:35,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-26 14:08:35,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-26 14:08:35,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:35,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-26 14:08:35,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,979 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 121 flow. Second operand 3 states and 734 transitions. [2023-08-26 14:08:35,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 255 flow [2023-08-26 14:08:35,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:35,980 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 146 flow [2023-08-26 14:08:35,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-26 14:08:35,983 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2023-08-26 14:08:35,983 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 146 flow [2023-08-26 14:08:35,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:35,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:35,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 14:08:35,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 14:08:35,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:35,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash 827212352, now seen corresponding path program 1 times [2023-08-26 14:08:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550477916] [2023-08-26 14:08:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:36,415 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 14:08:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550477916] [2023-08-26 14:08:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550477916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:08:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671656071] [2023-08-26 14:08:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:36,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:08:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:08:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:08:36,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 646 [2023-08-26 14:08:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 646 [2023-08-26 14:08:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:36,740 INFO L124 PetriNetUnfolderBase]: 1758/2954 cut-off events. [2023-08-26 14:08:36,741 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-26 14:08:36,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 2954 events. 1758/2954 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15723 event pairs, 429 based on Foata normal form. 29/2149 useless extension candidates. Maximal degree in co-relation 6041. Up to 2264 conditions per place. [2023-08-26 14:08:36,754 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 74 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-26 14:08:36,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 367 flow [2023-08-26 14:08:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-26 14:08:36,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325593395252838 [2023-08-26 14:08:36,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-26 14:08:36,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-26 14:08:36,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:36,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-26 14:08:36,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,763 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 146 flow. Second operand 3 states and 631 transitions. [2023-08-26 14:08:36,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 367 flow [2023-08-26 14:08:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:36,765 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 178 flow [2023-08-26 14:08:36,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-26 14:08:36,766 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 14:08:36,766 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 178 flow [2023-08-26 14:08:36,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:36,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 14:08:36,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 14:08:36,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:36,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 827214629, now seen corresponding path program 1 times [2023-08-26 14:08:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237261055] [2023-08-26 14:08:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:36,940 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 14:08:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237261055] [2023-08-26 14:08:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237261055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:08:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843468206] [2023-08-26 14:08:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:08:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:08:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:08:36,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 646 [2023-08-26 14:08:36,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:36,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:36,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 646 [2023-08-26 14:08:36,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:37,294 INFO L124 PetriNetUnfolderBase]: 1851/3141 cut-off events. [2023-08-26 14:08:37,294 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 14:08:37,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6615 conditions, 3141 events. 1851/3141 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 16983 event pairs, 741 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 6609. Up to 1892 conditions per place. [2023-08-26 14:08:37,308 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-26 14:08:37,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 406 flow [2023-08-26 14:08:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 14:08:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 14:08:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 830 transitions. [2023-08-26 14:08:37,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32120743034055727 [2023-08-26 14:08:37,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 830 transitions. [2023-08-26 14:08:37,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 830 transitions. [2023-08-26 14:08:37,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:37,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 830 transitions. [2023-08-26 14:08:37,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,317 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 178 flow. Second operand 4 states and 830 transitions. [2023-08-26 14:08:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 406 flow [2023-08-26 14:08:37,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:37,320 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 173 flow [2023-08-26 14:08:37,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-26 14:08:37,321 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:08:37,321 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 173 flow [2023-08-26 14:08:37,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:37,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:37,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 14:08:37,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:37,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash -986612324, now seen corresponding path program 1 times [2023-08-26 14:08:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932944781] [2023-08-26 14:08:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:37,365 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 14:08:37,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:37,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932944781] [2023-08-26 14:08:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932944781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:37,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:08:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685388258] [2023-08-26 14:08:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:37,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:37,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 646 [2023-08-26 14:08:37,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:37,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 646 [2023-08-26 14:08:37,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:37,498 INFO L124 PetriNetUnfolderBase]: 614/1214 cut-off events. [2023-08-26 14:08:37,498 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 14:08:37,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1214 events. 614/1214 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6261 event pairs, 387 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 2529. Up to 627 conditions per place. [2023-08-26 14:08:37,503 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 51 selfloop transitions, 2 changer transitions 8/68 dead transitions. [2023-08-26 14:08:37,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 311 flow [2023-08-26 14:08:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2023-08-26 14:08:37,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653250773993807 [2023-08-26 14:08:37,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2023-08-26 14:08:37,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2023-08-26 14:08:37,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:37,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2023-08-26 14:08:37,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,511 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 173 flow. Second operand 3 states and 846 transitions. [2023-08-26 14:08:37,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 311 flow [2023-08-26 14:08:37,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:37,513 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 165 flow [2023-08-26 14:08:37,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-08-26 14:08:37,513 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 14:08:37,513 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 165 flow [2023-08-26 14:08:37,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:37,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:37,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 14:08:37,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:37,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -589188273, now seen corresponding path program 1 times [2023-08-26 14:08:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67807225] [2023-08-26 14:08:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:37,589 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 14:08:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67807225] [2023-08-26 14:08:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67807225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:08:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158937801] [2023-08-26 14:08:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:08:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:08:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:08:37,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:08:37,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:37,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:08:37,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:37,732 INFO L124 PetriNetUnfolderBase]: 539/1036 cut-off events. [2023-08-26 14:08:37,733 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2023-08-26 14:08:37,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1036 events. 539/1036 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4939 event pairs, 464 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 2258. Up to 992 conditions per place. [2023-08-26 14:08:37,737 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 14:08:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 261 flow [2023-08-26 14:08:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:08:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:08:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-26 14:08:37,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32920536635706915 [2023-08-26 14:08:37,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-26 14:08:37,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-26 14:08:37,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:37,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-26 14:08:37,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,745 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 165 flow. Second operand 3 states and 638 transitions. [2023-08-26 14:08:37,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 261 flow [2023-08-26 14:08:37,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 14:08:37,747 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-08-26 14:08:37,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-08-26 14:08:37,748 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 14:08:37,748 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-08-26 14:08:37,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:37,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 14:08:37,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:37,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash -589188272, now seen corresponding path program 1 times [2023-08-26 14:08:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:37,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440832623] [2023-08-26 14:08:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:37,895 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 14:08:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440832623] [2023-08-26 14:08:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440832623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:08:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407672739] [2023-08-26 14:08:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:37,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:08:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:08:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:08:37,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 14:08:37,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:37,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:37,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 14:08:37,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:38,044 INFO L124 PetriNetUnfolderBase]: 429/800 cut-off events. [2023-08-26 14:08:38,044 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-08-26 14:08:38,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 800 events. 429/800 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3362 event pairs, 260 based on Foata normal form. 10/744 useless extension candidates. Maximal degree in co-relation 1779. Up to 566 conditions per place. [2023-08-26 14:08:38,048 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 61 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-26 14:08:38,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 319 flow [2023-08-26 14:08:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 14:08:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 14:08:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 839 transitions. [2023-08-26 14:08:38,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32469040247678016 [2023-08-26 14:08:38,051 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 839 transitions. [2023-08-26 14:08:38,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 839 transitions. [2023-08-26 14:08:38,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:38,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 839 transitions. [2023-08-26 14:08:38,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,057 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,057 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 4 states and 839 transitions. [2023-08-26 14:08:38,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 319 flow [2023-08-26 14:08:38,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 316 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:38,060 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 168 flow [2023-08-26 14:08:38,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-08-26 14:08:38,060 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 14:08:38,060 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 168 flow [2023-08-26 14:08:38,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:38,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:38,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 14:08:38,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:38,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1084964103, now seen corresponding path program 1 times [2023-08-26 14:08:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723185456] [2023-08-26 14:08:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:08:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723185456] [2023-08-26 14:08:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723185456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 14:08:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833351904] [2023-08-26 14:08:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 14:08:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 14:08:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 14:08:38,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 646 [2023-08-26 14:08:38,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:38,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 646 [2023-08-26 14:08:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:38,602 INFO L124 PetriNetUnfolderBase]: 421/793 cut-off events. [2023-08-26 14:08:38,602 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-26 14:08:38,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 793 events. 421/793 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3324 event pairs, 336 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1811. Up to 750 conditions per place. [2023-08-26 14:08:38,606 INFO L140 encePairwiseOnDemand]: 639/646 looper letters, 51 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-26 14:08:38,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 322 flow [2023-08-26 14:08:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:08:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:08:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2023-08-26 14:08:38,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33384932920536636 [2023-08-26 14:08:38,610 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1294 transitions. [2023-08-26 14:08:38,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1294 transitions. [2023-08-26 14:08:38,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:38,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1294 transitions. [2023-08-26 14:08:38,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,619 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,619 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 168 flow. Second operand 6 states and 1294 transitions. [2023-08-26 14:08:38,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 322 flow [2023-08-26 14:08:38,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 14:08:38,621 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 222 flow [2023-08-26 14:08:38,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-26 14:08:38,622 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -31 predicate places. [2023-08-26 14:08:38,622 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 222 flow [2023-08-26 14:08:38,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:38,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:38,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 14:08:38,623 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:38,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash -433731727, now seen corresponding path program 1 times [2023-08-26 14:08:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117022140] [2023-08-26 14:08:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:08:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117022140] [2023-08-26 14:08:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117022140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 14:08:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998925629] [2023-08-26 14:08:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:39,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 14:08:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 14:08:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 14:08:39,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:08:39,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:08:39,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:39,467 INFO L124 PetriNetUnfolderBase]: 550/1031 cut-off events. [2023-08-26 14:08:39,467 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-08-26 14:08:39,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1031 events. 550/1031 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4660 event pairs, 106 based on Foata normal form. 9/978 useless extension candidates. Maximal degree in co-relation 2479. Up to 687 conditions per place. [2023-08-26 14:08:39,472 INFO L140 encePairwiseOnDemand]: 636/646 looper letters, 68 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2023-08-26 14:08:39,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 480 flow [2023-08-26 14:08:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:08:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:08:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1118 transitions. [2023-08-26 14:08:39,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2884416924664603 [2023-08-26 14:08:39,477 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1118 transitions. [2023-08-26 14:08:39,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1118 transitions. [2023-08-26 14:08:39,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:39,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1118 transitions. [2023-08-26 14:08:39,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,484 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,484 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 222 flow. Second operand 6 states and 1118 transitions. [2023-08-26 14:08:39,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 480 flow [2023-08-26 14:08:39,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 472 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:39,488 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 320 flow [2023-08-26 14:08:39,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2023-08-26 14:08:39,489 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2023-08-26 14:08:39,489 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 320 flow [2023-08-26 14:08:39,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 14:08:39,490 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:39,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 821086537, now seen corresponding path program 2 times [2023-08-26 14:08:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762700554] [2023-08-26 14:08:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:08:39,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762700554] [2023-08-26 14:08:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762700554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:08:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:08:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 14:08:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976769330] [2023-08-26 14:08:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:08:39,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 14:08:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:08:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 14:08:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 14:08:39,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:08:39,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:39,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:08:39,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:08:39,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:08:40,215 INFO L124 PetriNetUnfolderBase]: 519/990 cut-off events. [2023-08-26 14:08:40,216 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2023-08-26 14:08:40,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 990 events. 519/990 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4443 event pairs, 157 based on Foata normal form. 9/957 useless extension candidates. Maximal degree in co-relation 2638. Up to 646 conditions per place. [2023-08-26 14:08:40,221 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 76 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2023-08-26 14:08:40,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 566 flow [2023-08-26 14:08:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:08:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:08:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-26 14:08:40,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28766769865841074 [2023-08-26 14:08:40,225 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-26 14:08:40,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-26 14:08:40,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:08:40,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-26 14:08:40,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:40,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:40,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:40,233 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 320 flow. Second operand 6 states and 1115 transitions. [2023-08-26 14:08:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 91 transitions, 566 flow [2023-08-26 14:08:40,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 550 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 14:08:40,237 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 360 flow [2023-08-26 14:08:40,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2023-08-26 14:08:40,238 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -18 predicate places. [2023-08-26 14:08:40,238 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 360 flow [2023-08-26 14:08:40,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:08:40,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:08:40,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:08:40,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 14:08:40,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:08:40,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:08:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 693396545, now seen corresponding path program 1 times [2023-08-26 14:08:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:08:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697943491] [2023-08-26 14:08:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:08:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:40,912 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 14:08:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:08:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697943491] [2023-08-26 14:08:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697943491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:08:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416312143] [2023-08-26 14:08:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:08:40,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:08:40,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:08:40,917 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 14:08:40,944 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 14:08:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:08:41,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-26 14:08:41,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:08:41,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:08:41,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:08:41,136 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:08:41,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:08:41,147 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 14:08:41,147 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 14:08:41,240 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 36 treesize of output 29 [2023-08-26 14:08:41,346 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 27 [2023-08-26 14:08:41,513 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 41 treesize of output 34 [2023-08-26 14:08:41,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:08:41,562 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 52 treesize of output 54 [2023-08-26 14:08:41,597 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 14:08:41,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:08:41,671 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_537 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_537 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:08:41,755 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse4))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse4)))))))) is different from false [2023-08-26 14:08:41,770 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:08:41,771 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 90 treesize of output 94 [2023-08-26 14:08:51,459 WARN L234 SmtUtils]: Spent 5.60s 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 14:09:00,178 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 14:09:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416312143] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:09:00,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:09:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-08-26 14:09:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851629822] [2023-08-26 14:09:00,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:09:00,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-26 14:09:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-26 14:09:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=382, Unknown=12, NotChecked=86, Total=600 [2023-08-26 14:09:00,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:09:00,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 360 flow. Second operand has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:00,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:00,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:09:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:10,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:09:13,348 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 14:09:25,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:09:26,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:09:33,252 INFO L124 PetriNetUnfolderBase]: 1054/2023 cut-off events. [2023-08-26 14:09:33,252 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2023-08-26 14:09:33,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5361 conditions, 2023 events. 1054/2023 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11075 event pairs, 508 based on Foata normal form. 31/1938 useless extension candidates. Maximal degree in co-relation 5343. Up to 1020 conditions per place. [2023-08-26 14:09:33,263 INFO L140 encePairwiseOnDemand]: 628/646 looper letters, 157 selfloop transitions, 52 changer transitions 0/212 dead transitions. [2023-08-26 14:09:33,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 212 transitions, 1312 flow [2023-08-26 14:09:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 14:09:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 14:09:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3831 transitions. [2023-08-26 14:09:33,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28239716939407344 [2023-08-26 14:09:33,275 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3831 transitions. [2023-08-26 14:09:33,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3831 transitions. [2023-08-26 14:09:33,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:33,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3831 transitions. [2023-08-26 14:09:33,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 182.42857142857142) internal successors, (3831), 21 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 646.0) internal successors, (14212), 22 states have internal predecessors, (14212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,300 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 646.0) internal successors, (14212), 22 states have internal predecessors, (14212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,300 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 360 flow. Second operand 21 states and 3831 transitions. [2023-08-26 14:09:33,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 212 transitions, 1312 flow [2023-08-26 14:09:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 212 transitions, 1290 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 14:09:33,308 INFO L231 Difference]: Finished difference. Result has 112 places, 111 transitions, 775 flow [2023-08-26 14:09:33,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=775, PETRI_PLACES=112, PETRI_TRANSITIONS=111} [2023-08-26 14:09:33,308 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places. [2023-08-26 14:09:33,308 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 775 flow [2023-08-26 14:09:33,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:33,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:33,317 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 14:09:33,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 14:09:33,516 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:33,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash -593236279, now seen corresponding path program 1 times [2023-08-26 14:09:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065985500] [2023-08-26 14:09:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:34,411 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 14:09:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065985500] [2023-08-26 14:09:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065985500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:09:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723154422] [2023-08-26 14:09:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:34,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:09:34,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:09:34,413 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 14:09:34,415 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 14:09:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:34,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 14:09:34,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:09:34,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:34,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:34,588 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:09:34,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:09:34,616 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:09:34,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-08-26 14:09:34,706 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 22 treesize of output 24 [2023-08-26 14:09:34,814 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 36 treesize of output 29 [2023-08-26 14:09:34,945 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 27 [2023-08-26 14:09:35,130 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 41 treesize of output 34 [2023-08-26 14:09:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,202 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 52 treesize of output 54 [2023-08-26 14:09:35,264 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 14:09:35,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:09:35,311 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_634 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_634 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:35,323 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_634 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_634 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:09:35,338 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_634 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_634 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:35,363 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_631 Int)) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_631) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse4))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_631 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_631) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_634) |c_~#queue~0.base|) .cse4)))))))) is different from false [2023-08-26 14:09:35,381 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:09:35,381 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 90 treesize of output 94 [2023-08-26 14:09:41,532 WARN L234 SmtUtils]: Spent 6.07s 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 14:09:51,508 WARN L234 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:09:55,940 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 14:09:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723154422] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:09:55,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:09:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-08-26 14:09:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512722378] [2023-08-26 14:09:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:09:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 14:09:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 14:09:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=455, Unknown=5, NotChecked=188, Total=756 [2023-08-26 14:09:55,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:09:55,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 775 flow. Second operand has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:55,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:55,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:09:55,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:10:20,981 WARN L234 SmtUtils]: Spent 24.63s on a formula simplification. DAG size of input: 133 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:10:23,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:10:31,659 WARN L234 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 117 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:10:44,468 WARN L234 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 107 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:10:51,045 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 109 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:10:57,427 WARN L234 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 158 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:11:00,054 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 14:11:02,077 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 14:11:17,779 WARN L234 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:11:20,937 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 14:11:22,975 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 14:11:29,592 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 14:11:31,597 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 14:11:33,615 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 14:11:42,480 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 14:11:48,647 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 14:12:00,235 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 14:12:01,931 INFO L124 PetriNetUnfolderBase]: 2210/4188 cut-off events. [2023-08-26 14:12:01,931 INFO L125 PetriNetUnfolderBase]: For 4763/4763 co-relation queries the response was YES. [2023-08-26 14:12:01,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13103 conditions, 4188 events. 2210/4188 cut-off events. For 4763/4763 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 27159 event pairs, 472 based on Foata normal form. 36/4023 useless extension candidates. Maximal degree in co-relation 13077. Up to 1562 conditions per place. [2023-08-26 14:12:01,955 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 264 selfloop transitions, 134 changer transitions 0/401 dead transitions. [2023-08-26 14:12:01,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 401 transitions, 2918 flow [2023-08-26 14:12:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-26 14:12:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-26 14:12:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5207 transitions. [2023-08-26 14:12:01,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2779438454147539 [2023-08-26 14:12:01,969 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5207 transitions. [2023-08-26 14:12:01,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5207 transitions. [2023-08-26 14:12:01,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:12:01,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5207 transitions. [2023-08-26 14:12:01,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 179.55172413793105) internal successors, (5207), 29 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 14:12:01,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 646.0) internal successors, (19380), 30 states have internal predecessors, (19380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:01,999 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 646.0) internal successors, (19380), 30 states have internal predecessors, (19380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:02,000 INFO L175 Difference]: Start difference. First operand has 112 places, 111 transitions, 775 flow. Second operand 29 states and 5207 transitions. [2023-08-26 14:12:02,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 401 transitions, 2918 flow [2023-08-26 14:12:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 401 transitions, 2732 flow, removed 81 selfloop flow, removed 6 redundant places. [2023-08-26 14:12:02,019 INFO L231 Difference]: Finished difference. Result has 150 places, 214 transitions, 1818 flow [2023-08-26 14:12:02,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1818, PETRI_PLACES=150, PETRI_TRANSITIONS=214} [2023-08-26 14:12:02,020 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 46 predicate places. [2023-08-26 14:12:02,020 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 214 transitions, 1818 flow [2023-08-26 14:12:02,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:02,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:12:02,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:12:02,031 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 14:12:02,227 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,SelfDestructingSolverStorable17 [2023-08-26 14:12:02,227 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:12:02,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:12:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 20455127, now seen corresponding path program 2 times [2023-08-26 14:12:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:12:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643023309] [2023-08-26 14:12:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:12:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:12:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:12:03,154 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 14:12:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:12:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643023309] [2023-08-26 14:12:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643023309] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:12:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844644638] [2023-08-26 14:12:03,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 14:12:03,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:12:03,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:12:03,156 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 14:12:03,163 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 14:12:03,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 14:12:03,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:12:03,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 14:12:03,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:12:03,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:03,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:03,349 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:12:03,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:12:03,375 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:12:03,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-08-26 14:12:03,529 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 36 treesize of output 29 [2023-08-26 14:12:03,611 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 27 [2023-08-26 14:12:03,758 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 41 treesize of output 34 [2023-08-26 14:12:03,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:03,826 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 52 treesize of output 54 [2023-08-26 14:12:03,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 52 treesize of output 54 [2023-08-26 14:12:03,923 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 14:12:03,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:12:03,930 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 38 treesize of output 34 [2023-08-26 14:12:04,037 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 402)))) is different from false [2023-08-26 14:12:04,123 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse1) 402)) (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:12:04,147 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_727 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_727) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_727 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_727) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse4) 402))))) is different from false [2023-08-26 14:12:09,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 14:12:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844644638] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:12:09,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:12:09,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 14:12:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991191854] [2023-08-26 14:12:09,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:12:09,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 14:12:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:12:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 14:12:09,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=411, Unknown=18, NotChecked=132, Total=650 [2023-08-26 14:12:09,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:12:09,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 214 transitions, 1818 flow. Second operand has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:09,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:12:09,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:12:09,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:12:15,928 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 14:12:17,943 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 14:12:20,050 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 14:12:22,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:24,391 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 14:12:27,350 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 14:12:29,621 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 14:12:31,776 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 14:12:33,872 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 14:12:35,994 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 14:12:43,039 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 14:12:45,069 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 14:12:47,676 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 14:12:50,193 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 14:12:50,877 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_731 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_731 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 402)) (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_731) |c_~#queue~0.base|) .cse0) 402)))) is different from false [2023-08-26 14:12:54,876 INFO L124 PetriNetUnfolderBase]: 3160/5943 cut-off events. [2023-08-26 14:12:54,876 INFO L125 PetriNetUnfolderBase]: For 64827/64831 co-relation queries the response was YES. [2023-08-26 14:12:54,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34625 conditions, 5943 events. 3160/5943 cut-off events. For 64827/64831 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 41183 event pairs, 676 based on Foata normal form. 45/5764 useless extension candidates. Maximal degree in co-relation 34583. Up to 2781 conditions per place. [2023-08-26 14:12:54,924 INFO L140 encePairwiseOnDemand]: 626/646 looper letters, 286 selfloop transitions, 130 changer transitions 0/419 dead transitions. [2023-08-26 14:12:54,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 419 transitions, 4934 flow [2023-08-26 14:12:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 14:12:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 14:12:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3236 transitions. [2023-08-26 14:12:54,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2782937736498108 [2023-08-26 14:12:54,930 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3236 transitions. [2023-08-26 14:12:54,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3236 transitions. [2023-08-26 14:12:54,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:12:54,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3236 transitions. [2023-08-26 14:12:54,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 179.77777777777777) internal successors, (3236), 18 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:54,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 646.0) internal successors, (12274), 19 states have internal predecessors, (12274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:54,946 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 646.0) internal successors, (12274), 19 states have internal predecessors, (12274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:54,947 INFO L175 Difference]: Start difference. First operand has 150 places, 214 transitions, 1818 flow. Second operand 18 states and 3236 transitions. [2023-08-26 14:12:54,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 419 transitions, 4934 flow [2023-08-26 14:12:55,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 419 transitions, 4655 flow, removed 124 selfloop flow, removed 5 redundant places. [2023-08-26 14:12:55,021 INFO L231 Difference]: Finished difference. Result has 170 places, 293 transitions, 2945 flow [2023-08-26 14:12:55,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2945, PETRI_PLACES=170, PETRI_TRANSITIONS=293} [2023-08-26 14:12:55,022 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 66 predicate places. [2023-08-26 14:12:55,022 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 293 transitions, 2945 flow [2023-08-26 14:12:55,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:55,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:12:55,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:12:55,034 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 14:12:55,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:12:55,235 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:12:55,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:12:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 40705305, now seen corresponding path program 1 times [2023-08-26 14:12:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:12:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286738210] [2023-08-26 14:12:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:12:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:12:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:12:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:12:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:12:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286738210] [2023-08-26 14:12:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286738210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:12:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655029615] [2023-08-26 14:12:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:12:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:12:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:12:56,663 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 14:12:56,664 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 14:12:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:12:56,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 14:12:56,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:12:56,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:56,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:56,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:12:56,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 14:12:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:12:57,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:12:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:12:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655029615] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:12:58,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:12:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2023-08-26 14:12:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058199337] [2023-08-26 14:12:58,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:12:58,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 14:12:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:12:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 14:12:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-08-26 14:12:58,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 14:12:58,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 293 transitions, 2945 flow. Second operand has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:12:58,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:12:58,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 14:12:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:13:02,950 INFO L124 PetriNetUnfolderBase]: 3134/5891 cut-off events. [2023-08-26 14:13:02,950 INFO L125 PetriNetUnfolderBase]: For 122251/122251 co-relation queries the response was YES. [2023-08-26 14:13:02,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43361 conditions, 5891 events. 3134/5891 cut-off events. For 122251/122251 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 37474 event pairs, 843 based on Foata normal form. 233/5918 useless extension candidates. Maximal degree in co-relation 43311. Up to 2325 conditions per place. [2023-08-26 14:13:02,998 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 374 selfloop transitions, 85 changer transitions 0/462 dead transitions. [2023-08-26 14:13:02,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 462 transitions, 6392 flow [2023-08-26 14:13:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 14:13:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 14:13:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3931 transitions. [2023-08-26 14:13:03,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27659724176752043 [2023-08-26 14:13:03,004 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3931 transitions. [2023-08-26 14:13:03,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3931 transitions. [2023-08-26 14:13:03,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:13:03,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3931 transitions. [2023-08-26 14:13:03,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 178.6818181818182) internal successors, (3931), 22 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:03,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:03,021 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:03,022 INFO L175 Difference]: Start difference. First operand has 170 places, 293 transitions, 2945 flow. Second operand 22 states and 3931 transitions. [2023-08-26 14:13:03,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 462 transitions, 6392 flow [2023-08-26 14:13:03,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 462 transitions, 5826 flow, removed 258 selfloop flow, removed 7 redundant places. [2023-08-26 14:13:03,123 INFO L231 Difference]: Finished difference. Result has 190 places, 282 transitions, 2837 flow [2023-08-26 14:13:03,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2837, PETRI_PLACES=190, PETRI_TRANSITIONS=282} [2023-08-26 14:13:03,124 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 86 predicate places. [2023-08-26 14:13:03,124 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 282 transitions, 2837 flow [2023-08-26 14:13:03,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:03,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:13:03,125 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:13:03,137 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 14:13:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:03,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:13:03,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:13:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash -696392966, now seen corresponding path program 1 times [2023-08-26 14:13:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:13:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435594274] [2023-08-26 14:13:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:13:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:13:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:13:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:13:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:13:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435594274] [2023-08-26 14:13:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435594274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:13:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721735272] [2023-08-26 14:13:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:13:05,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:05,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:13:05,393 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 14:13:05,399 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 14:13:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:13:05,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 14:13:05,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:13:06,498 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 11 treesize of output 7 [2023-08-26 14:13:06,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:06,637 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 14 treesize of output 16 [2023-08-26 14:13:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:13:06,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:13:07,096 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:13:07,096 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 26 treesize of output 27 [2023-08-26 14:13:07,131 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:13:07,132 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 44 treesize of output 43 [2023-08-26 14:13:07,181 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 11 treesize of output 7 [2023-08-26 14:13:07,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:13:07,198 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 14:13:07,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 14:13:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:07,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-26 14:13:07,743 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:13:07,743 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 25 treesize of output 29 [2023-08-26 14:13:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:13:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721735272] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:13:08,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:13:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2023-08-26 14:13:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932290964] [2023-08-26 14:13:08,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:13:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 14:13:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:13:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 14:13:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=452, Unknown=7, NotChecked=0, Total=552 [2023-08-26 14:13:08,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:13:08,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 282 transitions, 2837 flow. Second operand has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:08,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:13:08,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:13:08,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:13:13,026 INFO L124 PetriNetUnfolderBase]: 3293/6279 cut-off events. [2023-08-26 14:13:13,027 INFO L125 PetriNetUnfolderBase]: For 132515/132519 co-relation queries the response was YES. [2023-08-26 14:13:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46384 conditions, 6279 events. 3293/6279 cut-off events. For 132515/132519 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 40188 event pairs, 846 based on Foata normal form. 108/6091 useless extension candidates. Maximal degree in co-relation 46328. Up to 3250 conditions per place. [2023-08-26 14:13:13,085 INFO L140 encePairwiseOnDemand]: 635/646 looper letters, 297 selfloop transitions, 70 changer transitions 0/370 dead transitions. [2023-08-26 14:13:13,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 370 transitions, 5134 flow [2023-08-26 14:13:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 14:13:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 14:13:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2508 transitions. [2023-08-26 14:13:13,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2773109243697479 [2023-08-26 14:13:13,091 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2508 transitions. [2023-08-26 14:13:13,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2508 transitions. [2023-08-26 14:13:13,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:13:13,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2508 transitions. [2023-08-26 14:13:13,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 179.14285714285714) internal successors, (2508), 14 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:13,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:13,101 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:13,101 INFO L175 Difference]: Start difference. First operand has 190 places, 282 transitions, 2837 flow. Second operand 14 states and 2508 transitions. [2023-08-26 14:13:13,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 370 transitions, 5134 flow [2023-08-26 14:13:13,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 370 transitions, 5020 flow, removed 39 selfloop flow, removed 9 redundant places. [2023-08-26 14:13:13,190 INFO L231 Difference]: Finished difference. Result has 196 places, 289 transitions, 3032 flow [2023-08-26 14:13:13,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3032, PETRI_PLACES=196, PETRI_TRANSITIONS=289} [2023-08-26 14:13:13,191 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 92 predicate places. [2023-08-26 14:13:13,191 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 289 transitions, 3032 flow [2023-08-26 14:13:13,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:13,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:13:13,192 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 14:13:13,197 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 14:13:13,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:13,392 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:13:13,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:13:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -145800096, now seen corresponding path program 3 times [2023-08-26 14:13:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:13:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072744921] [2023-08-26 14:13:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:13:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:13:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:13:16,572 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 14:13:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:13:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072744921] [2023-08-26 14:13:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072744921] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:13:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780019867] [2023-08-26 14:13:16,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 14:13:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:13:16,574 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 14:13:16,575 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 14:13:16,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 14:13:16,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:13:16,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 98 conjunts are in the unsatisfiable core [2023-08-26 14:13:16,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:13:16,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:16,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:16,896 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:13:16,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:13:16,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:16,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:16,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 14:13:16,990 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:13:16,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-08-26 14:13:17,482 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 36 treesize of output 29 [2023-08-26 14:13:17,764 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 27 [2023-08-26 14:13:18,400 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 41 treesize of output 34 [2023-08-26 14:13:18,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:18,587 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 52 treesize of output 54 [2023-08-26 14:13:18,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 52 treesize of output 54 [2023-08-26 14:13:19,104 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 70 treesize of output 61 [2023-08-26 14:13:19,440 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 81 treesize of output 76 [2023-08-26 14:13:19,929 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 87 treesize of output 80 [2023-08-26 14:13:20,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:20,153 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 147 treesize of output 149 [2023-08-26 14:13:20,339 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 14:13:20,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:13:20,457 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1032 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1032 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:13:20,485 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1032 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1032 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-26 14:13:20,515 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1032 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1032 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:13:20,564 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1028) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1028) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-26 14:13:27,040 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:13:27,088 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1025 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1025))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1026))) (store (store .cse1 .cse2 v_ArrVal_1028) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse5 0)))))) (forall ((v_ArrVal_1025 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1025))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse6 0) (forall ((v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1026))) (store (store .cse8 .cse2 v_ArrVal_1028) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2023-08-26 14:13:27,143 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1025))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1026))) (store (store .cse2 .cse3 v_ArrVal_1028) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1025))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (let ((.cse9 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)))) (or (forall ((v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1032 (Array Int Int))) (<= (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1026))) (store (store .cse7 .cse3 v_ArrVal_1028) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1032) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse9 0)))))))) is different from false [2023-08-26 14:13:53,093 WARN L234 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:13:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-26 14:13:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780019867] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:13:53,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:13:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2023-08-26 14:13:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985749981] [2023-08-26 14:13:53,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:13:53,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-26 14:13:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:13:53,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-26 14:13:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=991, Unknown=31, NotChecked=426, Total=1640 [2023-08-26 14:13:53,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:13:53,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 289 transitions, 3032 flow. Second operand has 41 states, 41 states have (on average 169.609756097561) internal successors, (6954), 41 states have internal predecessors, (6954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:53,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:13:53,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:13:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:14:59,840 WARN L234 SmtUtils]: Spent 48.80s on a formula simplification. DAG size of input: 209 DAG size of output: 197 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:15:54,251 WARN L234 SmtUtils]: Spent 48.18s on a formula simplification. DAG size of input: 199 DAG size of output: 197 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:15:56,368 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 14:15:58,377 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 14:16:00,413 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 14:16:02,418 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 14:16:04,470 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 14:16:05,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:16:08,083 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 14:16:10,100 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 14:16:15,769 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 14:16:17,796 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 14:16:19,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:16:21,678 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 14:16:23,738 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 14:16:25,758 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 14:16:27,769 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 14:16:29,813 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 14:16:31,819 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 14:16:33,826 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 14:16:35,840 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 14:16:37,849 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 14:16:40,466 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 14:16:42,471 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 14:16:44,477 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 14:16:46,692 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 14:17:41,297 WARN L234 SmtUtils]: Spent 41.25s on a formula simplification. DAG size of input: 172 DAG size of output: 170 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:17:43,416 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 14:17:45,424 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 14:17:46,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:17:48,923 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 14:17:50,928 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 14:17:52,935 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 14:17:55,085 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 14:17:57,197 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 14:18:00,058 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 14:18:02,193 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 14:18:04,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:18:06,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:18:08,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:18:10,371 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 14:18:12,836 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 14:18:14,871 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 14:18:16,905 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 14:18:20,915 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 14:18:22,923 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 14:18:24,954 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 14:18:26,960 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 14:18:28,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:18:30,528 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 14:18:31,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:18:33,693 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 14:18:42,995 WARN L234 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:18:45,282 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 14:18:47,367 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 14:18:54,993 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 14:18:57,064 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 14:18:59,415 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 14:19:01,840 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 14:19:03,880 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 14:19:05,907 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 14:19:08,469 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 14:19:10,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:19:12,941 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 14:19:24,944 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 14:19:28,011 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 14:19:30,418 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 14:19:32,568 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 14:19:34,617 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 14:19:37,544 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 14:19:39,571 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 14:19:41,859 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 14:19:43,892 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 14:19:45,987 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 14:19:47,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:19:53,978 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 14:19:56,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:19:59,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:20:02,606 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 14:20:04,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:20:23,892 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 14:20:25,963 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 14:20:27,983 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 14:20:34,267 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 14:20:35,178 INFO L124 PetriNetUnfolderBase]: 3972/7543 cut-off events. [2023-08-26 14:20:35,178 INFO L125 PetriNetUnfolderBase]: For 157436/157436 co-relation queries the response was YES. [2023-08-26 14:20:35,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56543 conditions, 7543 events. 3972/7543 cut-off events. For 157436/157436 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 50237 event pairs, 1151 based on Foata normal form. 44/7281 useless extension candidates. Maximal degree in co-relation 56487. Up to 2961 conditions per place. [2023-08-26 14:20:35,234 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 289 selfloop transitions, 257 changer transitions 0/549 dead transitions. [2023-08-26 14:20:35,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 549 transitions, 8721 flow [2023-08-26 14:20:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-26 14:20:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-26 14:20:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6029 transitions. [2023-08-26 14:20:35,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2744946275723912 [2023-08-26 14:20:35,241 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6029 transitions. [2023-08-26 14:20:35,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6029 transitions. [2023-08-26 14:20:35,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:20:35,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6029 transitions. [2023-08-26 14:20:35,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 177.3235294117647) internal successors, (6029), 34 states have internal predecessors, (6029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:20:35,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 646.0) internal successors, (22610), 35 states have internal predecessors, (22610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:20:35,263 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 646.0) internal successors, (22610), 35 states have internal predecessors, (22610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:20:35,263 INFO L175 Difference]: Start difference. First operand has 196 places, 289 transitions, 3032 flow. Second operand 34 states and 6029 transitions. [2023-08-26 14:20:35,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 549 transitions, 8721 flow [2023-08-26 14:20:35,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 549 transitions, 8612 flow, removed 21 selfloop flow, removed 8 redundant places. [2023-08-26 14:20:35,358 INFO L231 Difference]: Finished difference. Result has 239 places, 402 transitions, 5923 flow [2023-08-26 14:20:35,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=5923, PETRI_PLACES=239, PETRI_TRANSITIONS=402} [2023-08-26 14:20:35,359 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 135 predicate places. [2023-08-26 14:20:35,359 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 402 transitions, 5923 flow [2023-08-26 14:20:35,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 169.609756097561) internal successors, (6954), 41 states have internal predecessors, (6954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:20:35,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:20:35,360 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 14:20:35,368 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 14:20:35,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:20:35,568 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:20:35,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:20:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 467873640, now seen corresponding path program 4 times [2023-08-26 14:20:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:20:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348301318] [2023-08-26 14:20:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:20:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:20:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:20:39,880 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 14:20:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:20:39,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348301318] [2023-08-26 14:20:39,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348301318] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:20:39,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515035028] [2023-08-26 14:20:39,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 14:20:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:20:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:20:39,881 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 14:20:39,884 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 14:20:40,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 14:20:40,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:20:40,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 93 conjunts are in the unsatisfiable core [2023-08-26 14:20:40,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:20:40,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:40,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:40,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:40,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 14:20:40,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:40,150 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:20:40,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:20:40,223 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:20:40,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-08-26 14:20:40,781 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 36 treesize of output 29 [2023-08-26 14:20:41,092 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 27 [2023-08-26 14:20:41,645 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 41 treesize of output 34 [2023-08-26 14:20:41,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:41,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 52 treesize of output 54 [2023-08-26 14:20:42,347 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 66 treesize of output 59 [2023-08-26 14:20:42,708 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 62 treesize of output 57 [2023-08-26 14:20:43,363 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 68 treesize of output 61 [2023-08-26 14:20:43,654 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 109 treesize of output 111 [2023-08-26 14:20:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:20:43,917 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 109 treesize of output 111 [2023-08-26 14:20:44,153 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 14:20:44,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:20:44,299 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1154 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1154 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:20:44,326 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-08-26 14:20:44,364 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:20:44,393 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:20:44,449 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1150) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1150) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-08-26 14:21:04,881 WARN L234 SmtUtils]: Spent 9.84s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:21:04,943 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse1 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse6 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse6 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))))) is different from false [2023-08-26 14:21:04,998 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|) (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse3 .cse4 v_ArrVal_1150) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|) (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse8 .cse4 v_ArrVal_1150) .cse1 (+ (select .cse8 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2023-08-26 14:21:05,059 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse1 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse7 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse7 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))))) is different from false [2023-08-26 14:21:13,782 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse6 .cse3))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| Int)) (or (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1143 Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1141))) (store (store .cse5 .cse2 v_ArrVal_1143) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse1 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))) (< .cse7 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| Int)) (or (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1143 Int) (v_ArrVal_1146 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1141))) (store (store .cse11 .cse2 v_ArrVal_1143) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1146))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1150 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1153 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1148))) (store (store .cse9 .cse2 v_ArrVal_1150) .cse3 (+ (select .cse9 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100|))))) (< .cse7 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102|)))))) is different from false [2023-08-26 14:21:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-08-26 14:21:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515035028] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:21:13,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:21:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2023-08-26 14:21:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369511437] [2023-08-26 14:21:13,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:21:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-26 14:21:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:21:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-26 14:21:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=788, Unknown=30, NotChecked=594, Total=1560 [2023-08-26 14:21:13,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:21:13,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 402 transitions, 5923 flow. Second operand has 40 states, 40 states have (on average 169.65) internal successors, (6786), 40 states have internal predecessors, (6786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:21:13,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:21:13,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:21:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:21:41,599 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 14:21:43,622 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 14:21:45,655 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 14:22:23,128 WARN L234 SmtUtils]: Spent 27.46s on a formula simplification. DAG size of input: 142 DAG size of output: 140 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:22:25,166 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] Received shutdown request... [2023-08-26 14:22:29,240 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 14:22:29,240 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 14:22:30,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 14:22:30,441 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 14:22:30,488 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 14:22:30,489 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 103 remaining) [2023-08-26 14:22:30,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 14:22:30,490 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 14:22:30,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2023-08-26 14:22:30,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2023-08-26 14:22:30,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2023-08-26 14:22:30,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2023-08-26 14:22:30,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (91 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2023-08-26 14:22:30,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (82 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2023-08-26 14:22:30,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2023-08-26 14:22:30,494 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2023-08-26 14:22:30,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2023-08-26 14:22:30,496 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (40 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2023-08-26 14:22:30,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2023-08-26 14:22:30,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2023-08-26 14:22:30,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2023-08-26 14:22:30,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (0 of 103 remaining) [2023-08-26 14:22:30,501 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:22:30,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 14:22:30,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 14:22:30,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:22:30 BasicIcfg [2023-08-26 14:22:30,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 14:22:30,510 INFO L158 Benchmark]: Toolchain (without parser) took 852748.87ms. Allocated memory was 358.6MB in the beginning and 750.8MB in the end (delta: 392.2MB). Free memory was 333.7MB in the beginning and 187.3MB in the end (delta: 146.5MB). Peak memory consumption was 540.2MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,510 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 14:22:30,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.35ms. Allocated memory is still 358.6MB. Free memory was 333.7MB in the beginning and 303.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.79ms. Allocated memory is still 358.6MB. Free memory was 303.9MB in the beginning and 300.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,510 INFO L158 Benchmark]: Boogie Preprocessor took 56.83ms. Allocated memory is still 358.6MB. Free memory was 300.8MB in the beginning and 298.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,511 INFO L158 Benchmark]: RCFGBuilder took 696.79ms. Allocated memory is still 358.6MB. Free memory was 298.7MB in the beginning and 320.9MB in the end (delta: -22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,511 INFO L158 Benchmark]: TraceAbstraction took 851313.62ms. Allocated memory was 358.6MB in the beginning and 750.8MB in the end (delta: 392.2MB). Free memory was 320.9MB in the beginning and 187.3MB in the end (delta: 133.7MB). Peak memory consumption was 527.8MB. Max. memory is 16.0GB. [2023-08-26 14:22:30,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 601.35ms. Allocated memory is still 358.6MB. Free memory was 333.7MB in the beginning and 303.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.79ms. Allocated memory is still 358.6MB. Free memory was 303.9MB in the beginning and 300.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.83ms. Allocated memory is still 358.6MB. Free memory was 300.8MB in the beginning and 298.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 696.79ms. Allocated memory is still 358.6MB. Free memory was 298.7MB in the beginning and 320.9MB in the end (delta: -22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 851313.62ms. Allocated memory was 358.6MB in the beginning and 750.8MB in the end (delta: 392.2MB). Free memory was 320.9MB in the beginning and 187.3MB in the end (delta: 133.7MB). Peak memory consumption was 527.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 263 PlacesBefore, 104 PlacesAfterwards, 271 TransitionsBefore, 104 TransitionsAfterwards, 18460 CoEnabledTransitionPairs, 8 FixpointIterations, 104 TrivialSequentialCompositions, 223 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 364 TotalNumberOfCompositions, 58098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25857, independent: 25085, independent conditional: 0, independent unconditional: 25085, dependent: 772, dependent conditional: 0, dependent unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11511, independent: 11395, independent conditional: 0, independent unconditional: 11395, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25857, independent: 13690, independent conditional: 0, independent unconditional: 13690, dependent: 656, dependent conditional: 0, dependent unconditional: 656, unknown: 11511, unknown conditional: 0, unknown unconditional: 11511] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 592, Positive conditional cache size: 0, Positive unconditional cache size: 592, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, 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: 21]: 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. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: -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: -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: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 103 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: 851.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 698.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 367 mSolverCounterUnknown, 3561 SdHoareTripleChecker+Valid, 285.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3561 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 280.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6966 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9098 IncrementalHoareTripleChecker+Invalid, 16921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 8 mSDtfsCounter, 9098 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 139 SyntacticMatches, 39 SemanticMatches, 331 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 3394 ImplicationChecksByTransitivity, 518.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5923occurred in iteration=22, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 137.3s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 451 ConstructedInterpolants, 130 QuantifiedInterpolants, 26773 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2191 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 37 InterpolantComputations, 16 PerfectInterpolantSequences, 17/114 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