/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:23:17,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:23:17,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 19:23:17,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:23:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:23:17,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:23:17,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:23:17,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:23:17,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:23:17,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:23:17,949 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:23:17,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:23:17,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:23:17,950 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:23:17,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:23:17,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:23:17,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:23:17,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:23:17,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:23:17,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:23:17,952 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:23:17,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:23:17,953 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:23:17,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:23:17,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:23:17,954 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:23:17,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:23:17,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:23:17,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:23:17,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:23:17,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:23:17,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:23:17,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:23:17,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:23:17,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:23:17,956 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:23:18,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:23:18,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:23:18,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:23:18,296 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:23:18,296 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:23:18,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-26 19:23:19,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:23:19,622 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:23:19,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-26 19:23:19,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb23415b/7f79558ecac54658bc0735aaf2112ac0/FLAG0baebb470 [2023-08-26 19:23:19,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb23415b/7f79558ecac54658bc0735aaf2112ac0 [2023-08-26 19:23:19,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:23:19,652 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:23:19,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:23:19,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:23:19,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:23:19,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85b8857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19, skipping insertion in model container [2023-08-26 19:23:19,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:23:19,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:23:19,873 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:23:19,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:23:19,925 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:23:19,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19 WrapperNode [2023-08-26 19:23:19,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:23:19,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:23:19,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:23:19,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:23:19,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,978 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-08-26 19:23:19,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:23:19,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:23:19,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:23:19,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:23:19,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:19,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:23:20,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:23:20,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:23:20,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:23:20,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (1/1) ... [2023-08-26 19:23:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:23:20,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:20,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 19:23:20,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 19:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:23:20,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:23:20,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 19:23:20,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 19:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 19:23:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 19:23:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:23:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 19:23:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 19:23:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 19:23:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 19:23:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:23:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:23:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:23:20,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 19:23:20,176 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:23:20,178 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:23:20,435 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:23:20,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:23:20,442 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 19:23:20,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:23:20 BoogieIcfgContainer [2023-08-26 19:23:20,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:23:20,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:23:20,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:23:20,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:23:20,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:23:19" (1/3) ... [2023-08-26 19:23:20,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@962f98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:23:20, skipping insertion in model container [2023-08-26 19:23:20,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:19" (2/3) ... [2023-08-26 19:23:20,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@962f98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:23:20, skipping insertion in model container [2023-08-26 19:23:20,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:23:20" (3/3) ... [2023-08-26 19:23:20,451 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-08-26 19:23:20,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:23:20,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 19:23:20,465 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:23:20,602 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 19:23:20,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 19:23:20,785 INFO L124 PetriNetUnfolderBase]: 14/188 cut-off events. [2023-08-26 19:23:20,785 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 19:23:20,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 188 events. 14/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 19:23:20,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 19:23:20,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:20,802 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:23:20,810 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:20,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:20,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:20,841 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-08-26 19:23:20,842 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 19:23:20,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 171 events. 14/171 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 130 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 19:23:20,846 INFO L119 LiptonReduction]: Number of co-enabled transitions 3780 [2023-08-26 19:23:27,451 INFO L134 LiptonReduction]: Checked pairs total: 4909 [2023-08-26 19:23:27,451 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-26 19:23:27,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:23:27,478 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@46dbc2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:23:27,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 19:23:27,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:23:27,480 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 19:23:27,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:27,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:27,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:23:27,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:27,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 685, now seen corresponding path program 1 times [2023-08-26 19:23:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:27,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713179426] [2023-08-26 19:23:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713179426] [2023-08-26 19:23:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713179426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:23:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541535315] [2023-08-26 19:23:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:27,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:23:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:23:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:23:27,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 361 [2023-08-26 19:23:27,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:27,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:27,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 361 [2023-08-26 19:23:27,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:28,048 INFO L124 PetriNetUnfolderBase]: 3537/4292 cut-off events. [2023-08-26 19:23:28,048 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-08-26 19:23:28,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 4292 events. 3537/4292 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11024 event pairs, 1737 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 6140. Up to 4293 conditions per place. [2023-08-26 19:23:28,072 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 59 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-26 19:23:28,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 272 flow [2023-08-26 19:23:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:23:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:23:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2023-08-26 19:23:28,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5637119113573407 [2023-08-26 19:23:28,085 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2023-08-26 19:23:28,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2023-08-26 19:23:28,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:28,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2023-08-26 19:23:28,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:28,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:28,096 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:28,098 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 158 flow. Second operand 2 states and 407 transitions. [2023-08-26 19:23:28,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 272 flow [2023-08-26 19:23:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 248 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 19:23:28,104 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 130 flow [2023-08-26 19:23:28,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-26 19:23:28,108 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 19:23:28,109 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 130 flow [2023-08-26 19:23:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:28,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:28,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:23:28,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:23:28,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:28,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 672761, now seen corresponding path program 1 times [2023-08-26 19:23:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411203509] [2023-08-26 19:23:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411203509] [2023-08-26 19:23:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411203509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683048445] [2023-08-26 19:23:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:28,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:28,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 19:23:28,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:28,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:28,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 19:23:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:28,985 INFO L124 PetriNetUnfolderBase]: 3375/4096 cut-off events. [2023-08-26 19:23:28,985 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:28,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 4096 events. 3375/4096 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10410 event pairs, 1656 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 8255. Up to 4096 conditions per place. [2023-08-26 19:23:29,005 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 56 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-26 19:23:29,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 240 flow [2023-08-26 19:23:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-26 19:23:29,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312096029547553 [2023-08-26 19:23:29,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-26 19:23:29,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-26 19:23:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:29,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-26 19:23:29,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,018 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 130 flow. Second operand 3 states and 467 transitions. [2023-08-26 19:23:29,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 240 flow [2023-08-26 19:23:29,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:23:29,023 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 128 flow [2023-08-26 19:23:29,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-26 19:23:29,024 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 19:23:29,024 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 128 flow [2023-08-26 19:23:29,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:29,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:23:29,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:23:29,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:29,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 672762, now seen corresponding path program 1 times [2023-08-26 19:23:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:29,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750957779] [2023-08-26 19:23:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750957779] [2023-08-26 19:23:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750957779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:29,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329616294] [2023-08-26 19:23:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:29,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:29,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 19:23:29,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:29,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 19:23:29,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:29,537 INFO L124 PetriNetUnfolderBase]: 3213/3900 cut-off events. [2023-08-26 19:23:29,537 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:29,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3900 events. 3213/3900 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9835 event pairs, 1575 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 7864. Up to 3900 conditions per place. [2023-08-26 19:23:29,556 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 54 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 19:23:29,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2023-08-26 19:23:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-08-26 19:23:29,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41274238227146814 [2023-08-26 19:23:29,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-08-26 19:23:29,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-08-26 19:23:29,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:29,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-08-26 19:23:29,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,562 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 128 flow. Second operand 3 states and 447 transitions. [2023-08-26 19:23:29,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2023-08-26 19:23:29,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:29,565 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 125 flow [2023-08-26 19:23:29,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=123, 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=125, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 19:23:29,566 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 19:23:29,566 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 125 flow [2023-08-26 19:23:29,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:29,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:23:29,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:23:29,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:29,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 646540505, now seen corresponding path program 1 times [2023-08-26 19:23:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624660511] [2023-08-26 19:23:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624660511] [2023-08-26 19:23:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624660511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767396287] [2023-08-26 19:23:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:29,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:29,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 19:23:29,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:29,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:29,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 19:23:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:30,118 INFO L124 PetriNetUnfolderBase]: 3141/3808 cut-off events. [2023-08-26 19:23:30,119 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:30,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 3808 events. 3141/3808 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9551 event pairs, 1539 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 7681. Up to 3808 conditions per place. [2023-08-26 19:23:30,135 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 52 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 19:23:30,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 227 flow [2023-08-26 19:23:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 19:23:30,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41089566020313945 [2023-08-26 19:23:30,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 19:23:30,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 19:23:30,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:30,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 19:23:30,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,141 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 125 flow. Second operand 3 states and 445 transitions. [2023-08-26 19:23:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 227 flow [2023-08-26 19:23:30,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:30,144 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 122 flow [2023-08-26 19:23:30,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=122, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-26 19:23:30,145 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 19:23:30,145 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 122 flow [2023-08-26 19:23:30,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:30,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:23:30,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:23:30,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:30,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 646540506, now seen corresponding path program 1 times [2023-08-26 19:23:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066334660] [2023-08-26 19:23:30,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066334660] [2023-08-26 19:23:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066334660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:30,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731959126] [2023-08-26 19:23:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:30,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:30,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 19:23:30,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:30,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 19:23:30,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:30,652 INFO L124 PetriNetUnfolderBase]: 3069/3716 cut-off events. [2023-08-26 19:23:30,652 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:30,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 3716 events. 3069/3716 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9281 event pairs, 1503 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 7498. Up to 3716 conditions per place. [2023-08-26 19:23:30,671 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 50 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 19:23:30,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 220 flow [2023-08-26 19:23:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-26 19:23:30,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42566943674976915 [2023-08-26 19:23:30,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-26 19:23:30,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-26 19:23:30,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:30,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-26 19:23:30,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,678 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 122 flow. Second operand 3 states and 461 transitions. [2023-08-26 19:23:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 220 flow [2023-08-26 19:23:30,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:30,681 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-26 19:23:30,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 19:23:30,682 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 19:23:30,683 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-26 19:23:30,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:30,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:30,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:23:30,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:30,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1444818079, now seen corresponding path program 1 times [2023-08-26 19:23:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143561273] [2023-08-26 19:23:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143561273] [2023-08-26 19:23:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143561273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:30,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:30,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097662376] [2023-08-26 19:23:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:30,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:30,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 19:23:30,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:30,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:30,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 19:23:30,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:31,068 INFO L124 PetriNetUnfolderBase]: 3021/3652 cut-off events. [2023-08-26 19:23:31,068 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7375 conditions, 3652 events. 3021/3652 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9084 event pairs, 1479 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 7371. Up to 3652 conditions per place. [2023-08-26 19:23:31,084 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 48 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-26 19:23:31,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 213 flow [2023-08-26 19:23:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-26 19:23:31,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.407202216066482 [2023-08-26 19:23:31,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-26 19:23:31,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-26 19:23:31,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:31,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-26 19:23:31,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,091 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 3 states and 441 transitions. [2023-08-26 19:23:31,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 213 flow [2023-08-26 19:23:31,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:31,093 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 116 flow [2023-08-26 19:23:31,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 19:23:31,095 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 19:23:31,095 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 116 flow [2023-08-26 19:23:31,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:31,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:31,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:23:31,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:31,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1444818081, now seen corresponding path program 1 times [2023-08-26 19:23:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104216787] [2023-08-26 19:23:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104216787] [2023-08-26 19:23:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104216787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796434736] [2023-08-26 19:23:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:31,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:31,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 19:23:31,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:31,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 19:23:31,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:31,469 INFO L124 PetriNetUnfolderBase]: 2973/3588 cut-off events. [2023-08-26 19:23:31,469 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:31,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7248 conditions, 3588 events. 2973/3588 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8918 event pairs, 1455 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 7244. Up to 3588 conditions per place. [2023-08-26 19:23:31,483 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 46 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 19:23:31,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 206 flow [2023-08-26 19:23:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-26 19:23:31,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42197599261311175 [2023-08-26 19:23:31,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-26 19:23:31,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-26 19:23:31,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:31,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-26 19:23:31,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,489 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 116 flow. Second operand 3 states and 457 transitions. [2023-08-26 19:23:31,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 206 flow [2023-08-26 19:23:31,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:31,491 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 113 flow [2023-08-26 19:23:31,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-26 19:23:31,492 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-08-26 19:23:31,492 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 113 flow [2023-08-26 19:23:31,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:31,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:31,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:23:31,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:31,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1195722952, now seen corresponding path program 1 times [2023-08-26 19:23:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679815096] [2023-08-26 19:23:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:31,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679815096] [2023-08-26 19:23:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679815096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410846966] [2023-08-26 19:23:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:31,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:31,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:31,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:31,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 19:23:31,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:31,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 19:23:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:31,772 INFO L124 PetriNetUnfolderBase]: 2901/3496 cut-off events. [2023-08-26 19:23:31,772 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:31,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 3496 events. 2901/3496 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8644 event pairs, 1419 based on Foata normal form. 0/1798 useless extension candidates. Maximal degree in co-relation 7061. Up to 3496 conditions per place. [2023-08-26 19:23:31,783 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 44 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 19:23:31,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 199 flow [2023-08-26 19:23:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-26 19:23:31,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2023-08-26 19:23:31,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-26 19:23:31,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-26 19:23:31,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:31,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-26 19:23:31,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,789 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 113 flow. Second operand 3 states and 437 transitions. [2023-08-26 19:23:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 199 flow [2023-08-26 19:23:31,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:31,792 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 110 flow [2023-08-26 19:23:31,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-26 19:23:31,794 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-08-26 19:23:31,794 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 110 flow [2023-08-26 19:23:31,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:31,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:31,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:23:31,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:31,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1195722950, now seen corresponding path program 1 times [2023-08-26 19:23:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770122825] [2023-08-26 19:23:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770122825] [2023-08-26 19:23:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770122825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:31,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709805150] [2023-08-26 19:23:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:31,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:31,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:31,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 19:23:31,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:31,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:31,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 19:23:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:32,076 INFO L124 PetriNetUnfolderBase]: 2829/3404 cut-off events. [2023-08-26 19:23:32,077 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 3404 events. 2829/3404 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8375 event pairs, 1383 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 6878. Up to 3404 conditions per place. [2023-08-26 19:23:32,091 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 42 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 19:23:32,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 192 flow [2023-08-26 19:23:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-26 19:23:32,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182825484764543 [2023-08-26 19:23:32,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-26 19:23:32,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-26 19:23:32,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:32,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-26 19:23:32,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,099 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 110 flow. Second operand 3 states and 453 transitions. [2023-08-26 19:23:32,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 192 flow [2023-08-26 19:23:32,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:32,100 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 107 flow [2023-08-26 19:23:32,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 19:23:32,101 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 19:23:32,101 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 107 flow [2023-08-26 19:23:32,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:32,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:32,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:23:32,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:32,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1961494981, now seen corresponding path program 1 times [2023-08-26 19:23:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687279061] [2023-08-26 19:23:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:32,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687279061] [2023-08-26 19:23:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687279061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:32,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:32,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904795150] [2023-08-26 19:23:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:32,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 19:23:32,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:32,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 19:23:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:32,335 INFO L124 PetriNetUnfolderBase]: 2667/3208 cut-off events. [2023-08-26 19:23:32,335 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 3208 events. 2667/3208 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7788 event pairs, 1302 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 6487. Up to 3208 conditions per place. [2023-08-26 19:23:32,348 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 40 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 19:23:32,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow [2023-08-26 19:23:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 19:23:32,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39981532779316714 [2023-08-26 19:23:32,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 19:23:32,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 19:23:32,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:32,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 19:23:32,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,353 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 107 flow. Second operand 3 states and 433 transitions. [2023-08-26 19:23:32,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow [2023-08-26 19:23:32,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:32,355 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 104 flow [2023-08-26 19:23:32,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-26 19:23:32,355 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 19:23:32,355 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 104 flow [2023-08-26 19:23:32,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:32,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:32,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:23:32,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:32,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1961494983, now seen corresponding path program 1 times [2023-08-26 19:23:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:32,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862004360] [2023-08-26 19:23:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862004360] [2023-08-26 19:23:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862004360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519654954] [2023-08-26 19:23:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:32,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:32,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 19:23:32,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:32,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 19:23:32,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:32,637 INFO L124 PetriNetUnfolderBase]: 2505/3012 cut-off events. [2023-08-26 19:23:32,637 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:32,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 3012 events. 2505/3012 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7213 event pairs, 1221 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 6096. Up to 3012 conditions per place. [2023-08-26 19:23:32,650 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 38 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 19:23:32,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 178 flow [2023-08-26 19:23:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 19:23:32,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458910433979684 [2023-08-26 19:23:32,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 19:23:32,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 19:23:32,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:32,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 19:23:32,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,655 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-26 19:23:32,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 178 flow [2023-08-26 19:23:32,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 39 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:32,656 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 101 flow [2023-08-26 19:23:32,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-26 19:23:32,657 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:32,657 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 101 flow [2023-08-26 19:23:32,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:32,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:32,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:23:32,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:32,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash -493949905, now seen corresponding path program 1 times [2023-08-26 19:23:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71726989] [2023-08-26 19:23:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:32,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:32,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71726989] [2023-08-26 19:23:32,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71726989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:32,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 19:23:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906450271] [2023-08-26 19:23:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:32,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 19:23:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 19:23:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:23:32,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 361 [2023-08-26 19:23:32,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:32,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:32,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 361 [2023-08-26 19:23:32,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:33,142 INFO L124 PetriNetUnfolderBase]: 2121/2564 cut-off events. [2023-08-26 19:23:33,142 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:33,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 2564 events. 2121/2564 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5940 event pairs, 1029 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 5201. Up to 2564 conditions per place. [2023-08-26 19:23:33,152 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 37 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 19:23:33,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 175 flow [2023-08-26 19:23:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 19:23:33,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3545706371191136 [2023-08-26 19:23:33,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 19:23:33,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 19:23:33,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:33,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 19:23:33,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,157 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 101 flow. Second operand 3 states and 384 transitions. [2023-08-26 19:23:33,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 175 flow [2023-08-26 19:23:33,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:33,158 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 100 flow [2023-08-26 19:23:33,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-26 19:23:33,159 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:33,159 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 100 flow [2023-08-26 19:23:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:33,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:33,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 19:23:33,160 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:33,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -493949907, now seen corresponding path program 1 times [2023-08-26 19:23:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418913680] [2023-08-26 19:23:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:33,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418913680] [2023-08-26 19:23:33,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418913680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:33,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:33,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:23:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225563142] [2023-08-26 19:23:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:33,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:33,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:33,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:33,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 361 [2023-08-26 19:23:33,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:33,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 361 [2023-08-26 19:23:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:33,908 INFO L124 PetriNetUnfolderBase]: 1737/2116 cut-off events. [2023-08-26 19:23:33,908 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 19:23:33,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 2116 events. 1737/2116 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4752 event pairs, 837 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 4306. Up to 2116 conditions per place. [2023-08-26 19:23:33,917 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 19:23:33,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 172 flow [2023-08-26 19:23:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 19:23:33,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3785780240073869 [2023-08-26 19:23:33,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 19:23:33,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 19:23:33,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:33,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 19:23:33,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,922 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 100 flow. Second operand 3 states and 410 transitions. [2023-08-26 19:23:33,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 172 flow [2023-08-26 19:23:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:33,923 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 99 flow [2023-08-26 19:23:33,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-26 19:23:33,924 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:33,924 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 99 flow [2023-08-26 19:23:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:33,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:33,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 19:23:33,925 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:33,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -15168890, now seen corresponding path program 1 times [2023-08-26 19:23:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881720878] [2023-08-26 19:23:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881720878] [2023-08-26 19:23:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881720878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831536469] [2023-08-26 19:23:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:34,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 19:23:34,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:34,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 19:23:34,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:34,522 INFO L124 PetriNetUnfolderBase]: 3277/3973 cut-off events. [2023-08-26 19:23:34,522 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-26 19:23:34,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8057 conditions, 3973 events. 3277/3973 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10555 event pairs, 837 based on Foata normal form. 1/2272 useless extension candidates. Maximal degree in co-relation 8053. Up to 2141 conditions per place. [2023-08-26 19:23:34,536 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 59 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-26 19:23:34,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 284 flow [2023-08-26 19:23:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2023-08-26 19:23:34,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050784856879039 [2023-08-26 19:23:34,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2023-08-26 19:23:34,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2023-08-26 19:23:34,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:34,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2023-08-26 19:23:34,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,541 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 99 flow. Second operand 3 states and 547 transitions. [2023-08-26 19:23:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 284 flow [2023-08-26 19:23:34,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:34,544 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 117 flow [2023-08-26 19:23:34,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-26 19:23:34,545 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 19:23:34,545 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 117 flow [2023-08-26 19:23:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:34,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:23:34,546 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:34,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1901196965, now seen corresponding path program 1 times [2023-08-26 19:23:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736628860] [2023-08-26 19:23:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736628860] [2023-08-26 19:23:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736628860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670445571] [2023-08-26 19:23:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:34,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:34,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:34,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:34,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:34,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:35,122 INFO L124 PetriNetUnfolderBase]: 3213/3909 cut-off events. [2023-08-26 19:23:35,122 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2023-08-26 19:23:35,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 3909 events. 3213/3909 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10731 event pairs, 247 based on Foata normal form. 64/2835 useless extension candidates. Maximal degree in co-relation 8645. Up to 1277 conditions per place. [2023-08-26 19:23:35,137 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 92 selfloop transitions, 6 changer transitions 8/106 dead transitions. [2023-08-26 19:23:35,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 485 flow [2023-08-26 19:23:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2023-08-26 19:23:35,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775623268698061 [2023-08-26 19:23:35,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2023-08-26 19:23:35,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2023-08-26 19:23:35,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:35,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2023-08-26 19:23:35,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:35,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:35,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:35,147 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 117 flow. Second operand 5 states and 862 transitions. [2023-08-26 19:23:35,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 485 flow [2023-08-26 19:23:35,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:35,149 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 138 flow [2023-08-26 19:23:35,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-26 19:23:35,150 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 19:23:35,150 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 138 flow [2023-08-26 19:23:35,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:35,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:35,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:35,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:23:35,151 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:35,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash -85369956, now seen corresponding path program 1 times [2023-08-26 19:23:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:35,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69447634] [2023-08-26 19:23:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:35,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69447634] [2023-08-26 19:23:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69447634] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396254950] [2023-08-26 19:23:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:35,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:35,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:23:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:35,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 19:23:35,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:23:35,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:23:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396254950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:23:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 19:23:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461352043] [2023-08-26 19:23:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:35,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:35,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:35,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:35,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:35,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:36,226 INFO L124 PetriNetUnfolderBase]: 5493/6691 cut-off events. [2023-08-26 19:23:36,227 INFO L125 PetriNetUnfolderBase]: For 2542/2542 co-relation queries the response was YES. [2023-08-26 19:23:36,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16244 conditions, 6691 events. 5493/6691 cut-off events. For 2542/2542 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 20384 event pairs, 1365 based on Foata normal form. 1/4740 useless extension candidates. Maximal degree in co-relation 16238. Up to 4322 conditions per place. [2023-08-26 19:23:36,260 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 69 selfloop transitions, 5 changer transitions 5/79 dead transitions. [2023-08-26 19:23:36,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 408 flow [2023-08-26 19:23:36,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-26 19:23:36,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48476454293628807 [2023-08-26 19:23:36,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-26 19:23:36,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-26 19:23:36,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:36,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-26 19:23:36,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:36,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:36,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:36,266 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 138 flow. Second operand 3 states and 525 transitions. [2023-08-26 19:23:36,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 408 flow [2023-08-26 19:23:36,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:36,276 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 167 flow [2023-08-26 19:23:36,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-26 19:23:36,277 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 19:23:36,277 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 167 flow [2023-08-26 19:23:36,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:36,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:36,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:36,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:36,484 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,SelfDestructingSolverStorable15 [2023-08-26 19:23:36,484 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:36,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 423726592, now seen corresponding path program 1 times [2023-08-26 19:23:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306821530] [2023-08-26 19:23:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:23:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306821530] [2023-08-26 19:23:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306821530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120109841] [2023-08-26 19:23:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:36,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:36,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:36,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:23:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:36,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 19:23:36,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:36,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:23:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120109841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:36,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:23:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 19:23:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222641073] [2023-08-26 19:23:36,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:36,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:36,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 19:23:36,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:36,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:36,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 19:23:36,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:37,542 INFO L124 PetriNetUnfolderBase]: 8219/10003 cut-off events. [2023-08-26 19:23:37,542 INFO L125 PetriNetUnfolderBase]: For 4397/4397 co-relation queries the response was YES. [2023-08-26 19:23:37,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28179 conditions, 10003 events. 8219/10003 cut-off events. For 4397/4397 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31793 event pairs, 2987 based on Foata normal form. 1/9818 useless extension candidates. Maximal degree in co-relation 28171. Up to 5800 conditions per place. [2023-08-26 19:23:37,595 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 69 selfloop transitions, 5 changer transitions 9/83 dead transitions. [2023-08-26 19:23:37,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 450 flow [2023-08-26 19:23:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2023-08-26 19:23:37,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124653739612188 [2023-08-26 19:23:37,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2023-08-26 19:23:37,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2023-08-26 19:23:37,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:37,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2023-08-26 19:23:37,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:37,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:37,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:37,600 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 167 flow. Second operand 3 states and 555 transitions. [2023-08-26 19:23:37,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 450 flow [2023-08-26 19:23:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:37,603 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 191 flow [2023-08-26 19:23:37,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-08-26 19:23:37,604 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-08-26 19:23:37,604 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 191 flow [2023-08-26 19:23:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:37,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:37,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:37,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:37,816 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,SelfDestructingSolverStorable16 [2023-08-26 19:23:37,816 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:37,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1361077693, now seen corresponding path program 1 times [2023-08-26 19:23:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:37,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860596439] [2023-08-26 19:23:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:23:38,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860596439] [2023-08-26 19:23:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860596439] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764405958] [2023-08-26 19:23:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:38,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:38,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:38,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:38,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:23:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:38,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 19:23:38,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:38,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:23:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764405958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:23:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 19:23:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104863008] [2023-08-26 19:23:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:38,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:38,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 19:23:38,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:38,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:38,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 19:23:38,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:39,153 INFO L124 PetriNetUnfolderBase]: 10945/13315 cut-off events. [2023-08-26 19:23:39,153 INFO L125 PetriNetUnfolderBase]: For 8531/8531 co-relation queries the response was YES. [2023-08-26 19:23:39,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38784 conditions, 13315 events. 10945/13315 cut-off events. For 8531/8531 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 44756 event pairs, 2919 based on Foata normal form. 1/13068 useless extension candidates. Maximal degree in co-relation 38775. Up to 7710 conditions per place. [2023-08-26 19:23:39,207 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 71 selfloop transitions, 5 changer transitions 5/81 dead transitions. [2023-08-26 19:23:39,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 464 flow [2023-08-26 19:23:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2023-08-26 19:23:39,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-26 19:23:39,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2023-08-26 19:23:39,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2023-08-26 19:23:39,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:39,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2023-08-26 19:23:39,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:39,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:39,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:39,213 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 191 flow. Second operand 3 states and 551 transitions. [2023-08-26 19:23:39,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 464 flow [2023-08-26 19:23:39,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:39,217 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 215 flow [2023-08-26 19:23:39,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-26 19:23:39,218 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-08-26 19:23:39,218 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 215 flow [2023-08-26 19:23:39,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:39,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:39,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:39,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:39,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 19:23:39,425 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:39,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1985544085, now seen corresponding path program 1 times [2023-08-26 19:23:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:39,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397433318] [2023-08-26 19:23:39,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397433318] [2023-08-26 19:23:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397433318] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472447729] [2023-08-26 19:23:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:39,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:39,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:23:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:39,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:39,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:39,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472447729] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:39,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 19:23:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611788439] [2023-08-26 19:23:39,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:39,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:23:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:39,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:23:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:39,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:39,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 158.4) internal successors, (792), 5 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:39,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:39,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:39,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:41,185 INFO L124 PetriNetUnfolderBase]: 15929/19479 cut-off events. [2023-08-26 19:23:41,185 INFO L125 PetriNetUnfolderBase]: For 16592/16592 co-relation queries the response was YES. [2023-08-26 19:23:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60763 conditions, 19479 events. 15929/19479 cut-off events. For 16592/16592 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 71161 event pairs, 3311 based on Foata normal form. 485/19592 useless extension candidates. Maximal degree in co-relation 60753. Up to 7618 conditions per place. [2023-08-26 19:23:41,265 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 121 selfloop transitions, 8 changer transitions 19/148 dead transitions. [2023-08-26 19:23:41,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 148 transitions, 857 flow [2023-08-26 19:23:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 880 transitions. [2023-08-26 19:23:41,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48753462603878117 [2023-08-26 19:23:41,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 880 transitions. [2023-08-26 19:23:41,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 880 transitions. [2023-08-26 19:23:41,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:41,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 880 transitions. [2023-08-26 19:23:41,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:41,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:41,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:41,285 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 215 flow. Second operand 5 states and 880 transitions. [2023-08-26 19:23:41,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 148 transitions, 857 flow [2023-08-26 19:23:41,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 148 transitions, 848 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:41,291 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 256 flow [2023-08-26 19:23:41,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2023-08-26 19:23:41,292 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-08-26 19:23:41,292 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 256 flow [2023-08-26 19:23:41,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.4) internal successors, (792), 5 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:41,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:41,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:41,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:41,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:41,505 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:41,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash -618853735, now seen corresponding path program 1 times [2023-08-26 19:23:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:41,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706206771] [2023-08-26 19:23:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:41,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706206771] [2023-08-26 19:23:41,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706206771] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723910770] [2023-08-26 19:23:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:41,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:41,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:41,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:41,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 19:23:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:41,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:41,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:42,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723910770] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:42,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:42,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 19:23:42,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7517611] [2023-08-26 19:23:42,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:23:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:23:42,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:42,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:42,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:42,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:42,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:43,892 INFO L124 PetriNetUnfolderBase]: 22301/27369 cut-off events. [2023-08-26 19:23:43,893 INFO L125 PetriNetUnfolderBase]: For 44567/44567 co-relation queries the response was YES. [2023-08-26 19:23:43,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89785 conditions, 27369 events. 22301/27369 cut-off events. For 44567/44567 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 105655 event pairs, 3899 based on Foata normal form. 757/27754 useless extension candidates. Maximal degree in co-relation 89773. Up to 9776 conditions per place. [2023-08-26 19:23:43,990 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 138 selfloop transitions, 6 changer transitions 7/151 dead transitions. [2023-08-26 19:23:43,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 1036 flow [2023-08-26 19:23:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2023-08-26 19:23:43,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47867036011080333 [2023-08-26 19:23:43,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2023-08-26 19:23:43,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2023-08-26 19:23:43,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:43,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2023-08-26 19:23:43,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:43,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:43,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:43,999 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 256 flow. Second operand 5 states and 864 transitions. [2023-08-26 19:23:44,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 1036 flow [2023-08-26 19:23:44,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 151 transitions, 1011 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:44,016 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 278 flow [2023-08-26 19:23:44,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-08-26 19:23:44,016 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-08-26 19:23:44,017 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 278 flow [2023-08-26 19:23:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:44,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:44,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:44,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:44,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:44,223 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:44,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2052743492, now seen corresponding path program 1 times [2023-08-26 19:23:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68396860] [2023-08-26 19:23:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68396860] [2023-08-26 19:23:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68396860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571048167] [2023-08-26 19:23:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:44,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:44,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:44,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 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 19:23:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:45,760 INFO L124 PetriNetUnfolderBase]: 16015/19559 cut-off events. [2023-08-26 19:23:45,760 INFO L125 PetriNetUnfolderBase]: For 38021/38021 co-relation queries the response was YES. [2023-08-26 19:23:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70081 conditions, 19559 events. 16015/19559 cut-off events. For 38021/38021 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 72570 event pairs, 955 based on Foata normal form. 298/19857 useless extension candidates. Maximal degree in co-relation 70066. Up to 7371 conditions per place. [2023-08-26 19:23:45,824 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 99 selfloop transitions, 6 changer transitions 44/149 dead transitions. [2023-08-26 19:23:45,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 998 flow [2023-08-26 19:23:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 870 transitions. [2023-08-26 19:23:45,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481994459833795 [2023-08-26 19:23:45,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 870 transitions. [2023-08-26 19:23:45,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 870 transitions. [2023-08-26 19:23:45,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:45,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 870 transitions. [2023-08-26 19:23:45,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:45,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:45,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:45,832 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 278 flow. Second operand 5 states and 870 transitions. [2023-08-26 19:23:45,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 998 flow [2023-08-26 19:23:45,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 969 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:45,878 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 286 flow [2023-08-26 19:23:45,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-08-26 19:23:45,879 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-08-26 19:23:45,879 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 286 flow [2023-08-26 19:23:45,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 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 19:23:45,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:45,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:45,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 19:23:45,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:45,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash 692702100, now seen corresponding path program 1 times [2023-08-26 19:23:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081296464] [2023-08-26 19:23:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:23:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081296464] [2023-08-26 19:23:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081296464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788928543] [2023-08-26 19:23:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:46,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:46,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:46,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 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 19:23:46,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:46,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:46,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:47,259 INFO L124 PetriNetUnfolderBase]: 10911/13143 cut-off events. [2023-08-26 19:23:47,259 INFO L125 PetriNetUnfolderBase]: For 25833/25833 co-relation queries the response was YES. [2023-08-26 19:23:47,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49175 conditions, 13143 events. 10911/13143 cut-off events. For 25833/25833 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 42084 event pairs, 869 based on Foata normal form. 376/13519 useless extension candidates. Maximal degree in co-relation 49158. Up to 8888 conditions per place. [2023-08-26 19:23:47,318 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 137 selfloop transitions, 6 changer transitions 0/143 dead transitions. [2023-08-26 19:23:47,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 143 transitions, 1061 flow [2023-08-26 19:23:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 19:23:47,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 19:23:47,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 19:23:47,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 19:23:47,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:47,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 19:23:47,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,326 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 286 flow. Second operand 5 states and 853 transitions. [2023-08-26 19:23:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 143 transitions, 1061 flow [2023-08-26 19:23:47,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 143 transitions, 1038 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:47,380 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 316 flow [2023-08-26 19:23:47,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2023-08-26 19:23:47,380 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-08-26 19:23:47,380 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 316 flow [2023-08-26 19:23:47,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 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 19:23:47,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:47,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:47,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 19:23:47,381 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:47,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash -311684484, now seen corresponding path program 1 times [2023-08-26 19:23:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969142213] [2023-08-26 19:23:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969142213] [2023-08-26 19:23:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969142213] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117828240] [2023-08-26 19:23:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:47,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:47,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 19:23:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:47,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:47,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:47,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117828240] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:47,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 19:23:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122907410] [2023-08-26 19:23:47,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:23:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:23:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:47,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:47,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 56 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:47,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:47,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:49,098 INFO L124 PetriNetUnfolderBase]: 13159/15827 cut-off events. [2023-08-26 19:23:49,098 INFO L125 PetriNetUnfolderBase]: For 38809/38809 co-relation queries the response was YES. [2023-08-26 19:23:49,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63149 conditions, 15827 events. 13159/15827 cut-off events. For 38809/38809 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 53618 event pairs, 1507 based on Foata normal form. 436/16263 useless extension candidates. Maximal degree in co-relation 63129. Up to 12452 conditions per place. [2023-08-26 19:23:49,163 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 133 selfloop transitions, 8 changer transitions 0/141 dead transitions. [2023-08-26 19:23:49,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 1057 flow [2023-08-26 19:23:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 19:23:49,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 19:23:49,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 19:23:49,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 19:23:49,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:49,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 19:23:49,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,172 INFO L175 Difference]: Start difference. First operand has 81 places, 56 transitions, 316 flow. Second operand 5 states and 853 transitions. [2023-08-26 19:23:49,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 1057 flow [2023-08-26 19:23:49,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 141 transitions, 1008 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:49,217 INFO L231 Difference]: Finished difference. Result has 86 places, 59 transitions, 353 flow [2023-08-26 19:23:49,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=86, PETRI_TRANSITIONS=59} [2023-08-26 19:23:49,217 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2023-08-26 19:23:49,217 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 59 transitions, 353 flow [2023-08-26 19:23:49,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:49,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:49,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:49,432 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:49,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -382240083, now seen corresponding path program 1 times [2023-08-26 19:23:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15335491] [2023-08-26 19:23:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15335491] [2023-08-26 19:23:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15335491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543728927] [2023-08-26 19:23:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:49,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:49,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:49,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:49,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 59 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 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 19:23:49,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:49,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:49,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:50,786 INFO L124 PetriNetUnfolderBase]: 12835/15503 cut-off events. [2023-08-26 19:23:50,786 INFO L125 PetriNetUnfolderBase]: For 54444/54444 co-relation queries the response was YES. [2023-08-26 19:23:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64610 conditions, 15503 events. 12835/15503 cut-off events. For 54444/54444 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 53884 event pairs, 462 based on Foata normal form. 324/15827 useless extension candidates. Maximal degree in co-relation 64587. Up to 5296 conditions per place. [2023-08-26 19:23:50,840 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 156 selfloop transitions, 9 changer transitions 12/177 dead transitions. [2023-08-26 19:23:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 177 transitions, 1398 flow [2023-08-26 19:23:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-08-26 19:23:50,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47977839335180056 [2023-08-26 19:23:50,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-08-26 19:23:50,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-08-26 19:23:50,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:50,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-08-26 19:23:50,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,848 INFO L175 Difference]: Start difference. First operand has 86 places, 59 transitions, 353 flow. Second operand 5 states and 866 transitions. [2023-08-26 19:23:50,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 177 transitions, 1398 flow [2023-08-26 19:23:50,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 177 transitions, 1349 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:50,871 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 378 flow [2023-08-26 19:23:50,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2023-08-26 19:23:50,871 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-08-26 19:23:50,871 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 378 flow [2023-08-26 19:23:50,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 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 19:23:50,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:50,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:50,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 19:23:50,872 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:50,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2068628831, now seen corresponding path program 1 times [2023-08-26 19:23:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488048175] [2023-08-26 19:23:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488048175] [2023-08-26 19:23:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488048175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098800542] [2023-08-26 19:23:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:51,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:51,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 19:23:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:51,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:51,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:51,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098800542] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:51,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 19:23:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261974767] [2023-08-26 19:23:51,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:51,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:23:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:23:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:51,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:51,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 62 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:51,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:51,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:52,861 INFO L124 PetriNetUnfolderBase]: 16972/20583 cut-off events. [2023-08-26 19:23:52,862 INFO L125 PetriNetUnfolderBase]: For 66172/66172 co-relation queries the response was YES. [2023-08-26 19:23:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90633 conditions, 20583 events. 16972/20583 cut-off events. For 66172/66172 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 74994 event pairs, 2230 based on Foata normal form. 631/21214 useless extension candidates. Maximal degree in co-relation 90608. Up to 8673 conditions per place. [2023-08-26 19:23:53,136 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 158 selfloop transitions, 8 changer transitions 16/182 dead transitions. [2023-08-26 19:23:53,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 182 transitions, 1410 flow [2023-08-26 19:23:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2023-08-26 19:23:53,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48310249307479225 [2023-08-26 19:23:53,139 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2023-08-26 19:23:53,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2023-08-26 19:23:53,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:53,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2023-08-26 19:23:53,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,144 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 378 flow. Second operand 5 states and 872 transitions. [2023-08-26 19:23:53,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 182 transitions, 1410 flow [2023-08-26 19:23:53,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 182 transitions, 1403 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:53,189 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 400 flow [2023-08-26 19:23:53,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2023-08-26 19:23:53,190 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2023-08-26 19:23:53,190 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 400 flow [2023-08-26 19:23:53,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:53,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:53,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 19:23:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:53,397 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:53,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1382979613, now seen corresponding path program 2 times [2023-08-26 19:23:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:53,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056136878] [2023-08-26 19:23:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056136878] [2023-08-26 19:23:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056136878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845307656] [2023-08-26 19:23:53,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:23:53,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:53,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 19:23:53,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:23:53,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:23:53,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:53,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:53,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:23:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845307656] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:53,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 19:23:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521031683] [2023-08-26 19:23:53,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:53,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:23:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:23:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:23:53,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 19:23:53,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:53,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 19:23:53,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:55,241 INFO L124 PetriNetUnfolderBase]: 14584/17497 cut-off events. [2023-08-26 19:23:55,241 INFO L125 PetriNetUnfolderBase]: For 55860/55860 co-relation queries the response was YES. [2023-08-26 19:23:55,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82687 conditions, 17497 events. 14584/17497 cut-off events. For 55860/55860 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 60475 event pairs, 480 based on Foata normal form. 612/18109 useless extension candidates. Maximal degree in co-relation 82659. Up to 12651 conditions per place. [2023-08-26 19:23:55,323 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 157 selfloop transitions, 8 changer transitions 0/165 dead transitions. [2023-08-26 19:23:55,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 1359 flow [2023-08-26 19:23:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 19:23:55,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 19:23:55,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 19:23:55,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 19:23:55,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:55,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 19:23:55,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,329 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,330 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 400 flow. Second operand 5 states and 853 transitions. [2023-08-26 19:23:55,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 1359 flow [2023-08-26 19:23:55,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 165 transitions, 1346 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:55,424 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 437 flow [2023-08-26 19:23:55,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2023-08-26 19:23:55,424 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 25 predicate places. [2023-08-26 19:23:55,425 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 437 flow [2023-08-26 19:23:55,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:55,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:55,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:55,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 19:23:55,631 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:55,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1492221821, now seen corresponding path program 1 times [2023-08-26 19:23:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238689190] [2023-08-26 19:23:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238689190] [2023-08-26 19:23:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238689190] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543382918] [2023-08-26 19:23:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:56,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 19:23:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:57,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:23:57,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:58,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:23:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543382918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:59,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-08-26 19:23:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731000450] [2023-08-26 19:23:59,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:59,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 19:23:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 19:23:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-08-26 19:23:59,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 361 [2023-08-26 19:23:59,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 65 transitions, 437 flow. Second operand has 18 states, 18 states have (on average 148.16666666666666) internal successors, (2667), 18 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:59,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 361 [2023-08-26 19:23:59,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:01,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:05,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:13,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:15,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:20,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:32,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:39,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:44,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:49,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:12,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:34,364 WARN L234 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 65 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:25:49,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:17,307 WARN L234 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 77 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:26:19,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:41,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:44,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:13,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:35,948 INFO L124 PetriNetUnfolderBase]: 87628/108379 cut-off events. [2023-08-26 19:27:35,948 INFO L125 PetriNetUnfolderBase]: For 422264/422264 co-relation queries the response was YES. [2023-08-26 19:27:36,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521123 conditions, 108379 events. 87628/108379 cut-off events. For 422264/422264 co-relation queries the response was YES. Maximal size of possible extension queue 2260. Compared 515325 event pairs, 1546 based on Foata normal form. 2926/111305 useless extension candidates. Maximal degree in co-relation 521092. Up to 36243 conditions per place. [2023-08-26 19:27:36,701 INFO L140 encePairwiseOnDemand]: 348/361 looper letters, 957 selfloop transitions, 265 changer transitions 980/2202 dead transitions. [2023-08-26 19:27:36,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 2202 transitions, 16301 flow [2023-08-26 19:27:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-08-26 19:27:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-08-26 19:27:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 13047 transitions. [2023-08-26 19:27:36,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517659279778393 [2023-08-26 19:27:36,717 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 13047 transitions. [2023-08-26 19:27:36,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 13047 transitions. [2023-08-26 19:27:36,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:27:36,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 13047 transitions. [2023-08-26 19:27:36,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 163.0875) internal successors, (13047), 80 states have internal predecessors, (13047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:27:36,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 361.0) internal successors, (29241), 81 states have internal predecessors, (29241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:27:36,771 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 361.0) internal successors, (29241), 81 states have internal predecessors, (29241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:27:36,771 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 437 flow. Second operand 80 states and 13047 transitions. [2023-08-26 19:27:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 2202 transitions, 16301 flow [2023-08-26 19:27:43,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 2202 transitions, 16144 flow, removed 57 selfloop flow, removed 1 redundant places. [2023-08-26 19:27:43,823 INFO L231 Difference]: Finished difference. Result has 234 places, 356 transitions, 4116 flow [2023-08-26 19:27:43,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=4116, PETRI_PLACES=234, PETRI_TRANSITIONS=356} [2023-08-26 19:27:43,824 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 160 predicate places. [2023-08-26 19:27:43,824 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 356 transitions, 4116 flow [2023-08-26 19:27:43,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 148.16666666666666) internal successors, (2667), 18 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:27:43,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:27:43,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:27:43,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 19:27:44,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 19:27:44,025 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:27:44,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:27:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 952737379, now seen corresponding path program 2 times [2023-08-26 19:27:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:27:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996927735] [2023-08-26 19:27:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:27:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:27:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:27:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 19:27:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:27:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996927735] [2023-08-26 19:27:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996927735] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:27:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642700883] [2023-08-26 19:27:44,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:27:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:27:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:27:44,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:27:44,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 19:28:08,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:28:08,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:28:08,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-26 19:28:08,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:29:52,609 WARN L234 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:30:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:30:28,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:30:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:30:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642700883] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:30:49,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:30:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 20 [2023-08-26 19:30:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119493757] [2023-08-26 19:30:49,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:30:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 19:30:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:30:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 19:30:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=295, Unknown=32, NotChecked=0, Total=462 [2023-08-26 19:30:49,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 361 [2023-08-26 19:30:49,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 356 transitions, 4116 flow. Second operand has 22 states, 22 states have (on average 147.04545454545453) internal successors, (3235), 22 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:30:49,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:30:49,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 361 [2023-08-26 19:30:49,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:30:53,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:55,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:00,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:06,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:08,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:10,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:13,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:15,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:17,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:19,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:21,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:24,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:26,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:44,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:46,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:48,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:52,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:54,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:56,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:58,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:06,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:10,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:12,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:14,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:16,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:18,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:20,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:22,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:24,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:26,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:28,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:30,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:32,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:34,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:36,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:38,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:40,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:42,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:44,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:46,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:48,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:50,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:52,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:00,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:02,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:05,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:06,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:09,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:16,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:18,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:20,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:41,945 WARN L234 SmtUtils]: Spent 17.00s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:33:44,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:46,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:48,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:57,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:59,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:01,691 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (mod c_~x3~0 2147483648)) (.cse24 (mod c_~x4~0 2147483648))) (let ((.cse12 (* (- 1) c_~x3~0)) (.cse19 (mod c_~x1~0 2147483648)) (.cse20 (* .cse24 2)) (.cse1 (mod c_~x2~0 4294967296)) (.cse16 (* 2 .cse25)) (.cse5 (mod c_~n~0 4294967296)) (.cse21 (mod c_~x3~0 4294967296))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse9 (div c_~n~0 4294967296)) (.cse10 (* (div c_~x4~0 2147483648) 4294967296)) (.cse8 (* 2 c_~x4~0)) (.cse11 (* 3 c_~n~0)) (.cse3 (<= .cse5 .cse21)) (.cse4 (< .cse16 .cse5)) (.cse6 (< .cse1 .cse5)) (.cse7 (< .cse20 .cse5)) (.cse2 (= .cse24 .cse25)) (.cse13 (* 2 .cse19)) (.cse22 (mod (* 4294967295 (div .cse12 2)) 4294967296)) (.cse23 (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296))) (and (= (mod c_~x2~0 2) 0) (or (= .cse0 .cse1) .cse2 .cse3 .cse4 (< .cse0 .cse5) .cse6 .cse7) (<= (+ .cse8 (* 4294967296 .cse9)) (+ c_~x3~0 (* (div (+ .cse10 (* 4 c_~x4~0) (- 4) (* c_~x3~0 (- 3)) .cse11) 12884901888) 4294967296))) (<= .cse5 .cse0) (<= (+ (* 12884901888 .cse9) 4 (* 6 c_~x4~0)) (+ .cse10 (* c_~x3~0 2) (* 8589934592 (div (+ .cse8 .cse12) 4294967296)) .cse11)) (= (mod c_~x1~0 2) 0) (or .cse2 (< .cse13 .cse5) (= .cse1 .cse13) .cse3 .cse4 .cse6 .cse7) (let ((.cse18 (mod c_~x2~0 2147483648))) (let ((.cse14 (* .cse18 2)) (.cse15 (+ .cse1 1)) (.cse17 (+ .cse21 1))) (or .cse2 (< .cse14 .cse15) (< .cse16 .cse15) (< .cse14 .cse17) (< .cse16 .cse17) (< .cse13 .cse15) (= .cse18 .cse19) (< .cse13 .cse17) (< .cse20 .cse15) (< .cse20 .cse17)))) (= .cse22 (mod c_~x4~0 4294967296)) (= .cse23 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (< .cse22 .cse5) (= (mod c_~x3~0 2) 0) (< .cse23 .cse5))))) is different from false [2023-08-26 19:34:03,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:05,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:07,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:15,097 WARN L234 SmtUtils]: Spent 5.24s 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 19:34:17,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:19,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:24,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:26,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:30,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:32,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:35,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:37,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:39,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:41,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:43,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:45,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:47,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:50,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:52,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:55,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:58,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:00,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:12,974 WARN L234 SmtUtils]: Spent 10.60s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:35:15,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:19,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:21,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:23,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:25,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:32,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:34,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:36,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:38,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:40,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:42,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:44,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:47,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:49,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:51,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:53,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:55,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:05,118 WARN L234 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:36:07,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:09,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:12,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:14,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:23,913 WARN L234 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:36:29,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:31,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:33,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:35,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:38,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:40,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:41,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:43,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:45,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:47,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:50,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:52,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:54,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:56,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:58,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:00,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:02,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:05,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:07,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:09,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:12,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:14,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:16,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:18,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:20,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:22,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:24,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:26,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:28,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:31,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:33,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 19:37:35,233 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:37:35,233 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:37:35,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:37:36,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 19:37:36,434 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 19:37:36,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 19:37:36,442 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (30 of 31 remaining) [2023-08-26 19:37:36,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 19:37:36,443 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-08-26 19:37:36,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-08-26 19:37:36,445 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 31 remaining) [2023-08-26 19:37:36,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 31 remaining) [2023-08-26 19:37:36,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 31 remaining) [2023-08-26 19:37:36,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 31 remaining) [2023-08-26 19:37:36,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2023-08-26 19:37:36,447 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:37:36,450 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:37:36,450 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:37:36,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:37:36 BasicIcfg [2023-08-26 19:37:36,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:37:36,454 INFO L158 Benchmark]: Toolchain (without parser) took 856802.88ms. Allocated memory was 390.1MB in the beginning and 10.8GB in the end (delta: 10.4GB). Free memory was 366.3MB in the beginning and 8.4GB in the end (delta: -8.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory was 366.2MB in the beginning and 366.0MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.87ms. Allocated memory is still 390.1MB. Free memory was 365.7MB in the beginning and 354.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.93ms. Allocated memory is still 390.1MB. Free memory was 354.4MB in the beginning and 352.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 390.1MB. Free memory was 352.3MB in the beginning and 350.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: RCFGBuilder took 428.16ms. Allocated memory is still 390.1MB. Free memory was 350.8MB in the beginning and 330.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 19:37:36,455 INFO L158 Benchmark]: TraceAbstraction took 856008.08ms. Allocated memory was 390.1MB in the beginning and 10.8GB in the end (delta: 10.4GB). Free memory was 329.3MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 19:37:36,456 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.11ms. Allocated memory is still 390.1MB. Free memory was 366.2MB in the beginning and 366.0MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 271.87ms. Allocated memory is still 390.1MB. Free memory was 365.7MB in the beginning and 354.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.93ms. Allocated memory is still 390.1MB. Free memory was 354.4MB in the beginning and 352.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 390.1MB. Free memory was 352.3MB in the beginning and 350.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 428.16ms. Allocated memory is still 390.1MB. Free memory was 350.8MB in the beginning and 330.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 856008.08ms. Allocated memory was 390.1MB in the beginning and 10.8GB in the end (delta: 10.4GB). Free memory was 329.3MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 176 PlacesBefore, 74 PlacesAfterwards, 171 TransitionsBefore, 61 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 12 ConcurrentYvCompositions, 8 ChoiceCompositions, 167 TotalNumberOfCompositions, 4909 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4909, independent: 4909, independent conditional: 0, independent unconditional: 4909, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1950, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4909, independent: 2959, independent conditional: 0, independent unconditional: 2959, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1950, unknown conditional: 0, unknown unconditional: 1950] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while 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: 107]: 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: 103]: 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: 108]: 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: 105]: 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: 104]: 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: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 217 locations, 31 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: 855.8s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 649.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 136 mSolverCounterUnknown, 2281 SdHoareTripleChecker+Valid, 365.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2281 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 362.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 176 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7453 IncrementalHoareTripleChecker+Invalid, 7884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 0 mSDtfsCounter, 7453 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 548 SyntacticMatches, 17 SemanticMatches, 190 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 355.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4116occurred in iteration=27, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 25.8s SatisfiabilityAnalysisTime, 169.7s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 17722 SizeOfPredicates, 73 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 45 InterpolantComputations, 21 PerfectInterpolantSequences, 82/118 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