/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:55:59,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:55:59,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:55:59,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:55:59,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:55:59,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:55:59,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:55:59,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:55:59,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:55:59,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:55:59,868 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:55:59,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:55:59,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:55:59,869 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:55:59,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:55:59,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:55:59,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:55:59,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:55:59,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:55:59,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:55:59,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:55:59,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:55:59,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:55:59,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:55:59,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:55:59,873 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:55:59,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:55:59,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:55:59,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:55:59,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:55:59,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:55:59,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:55:59,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:55:59,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:55:59,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:55:59,876 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:56:00,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:56:00,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:56:00,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:56:00,199 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:56:00,199 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:56:00,200 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 12:56:01,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:56:01,601 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:56:01,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-26 12:56:01,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbace13eb/5980049a7cf2497daccbb4e7b2f86032/FLAG959883995 [2023-08-26 12:56:01,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbace13eb/5980049a7cf2497daccbb4e7b2f86032 [2023-08-26 12:56:01,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:56:01,624 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:56:01,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:56:01,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:56:01,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:56:01,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd3f49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01, skipping insertion in model container [2023-08-26 12:56:01,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:56:01,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:56:01,838 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:56:01,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:56:01,871 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:56:01,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01 WrapperNode [2023-08-26 12:56:01,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:56:01,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:56:01,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:56:01,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:56:01,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,903 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-08-26 12:56:01,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:56:01,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:56:01,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:56:01,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:56:01,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:56:01,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:56:01,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:56:01,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:56:01,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (1/1) ... [2023-08-26 12:56:01,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:56:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:01,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:56:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:56:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:56:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:56:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:56:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:56:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 12:56:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 12:56:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 12:56:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 12:56:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 12:56:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 12:56:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 12:56:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 12:56:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:56:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 12:56:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 12:56:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 12:56:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 12:56:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:56:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:56:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:56:01,985 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:56:02,068 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:56:02,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:56:02,486 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:56:02,494 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:56:02,494 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 12:56:02,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:56:02 BoogieIcfgContainer [2023-08-26 12:56:02,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:56:02,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:56:02,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:56:02,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:56:02,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:56:01" (1/3) ... [2023-08-26 12:56:02,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ced16c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:56:02, skipping insertion in model container [2023-08-26 12:56:02,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:56:01" (2/3) ... [2023-08-26 12:56:02,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ced16c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:56:02, skipping insertion in model container [2023-08-26 12:56:02,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:56:02" (3/3) ... [2023-08-26 12:56:02,506 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-08-26 12:56:02,524 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:56:02,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 12:56:02,525 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:56:02,646 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 12:56:02,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 12:56:02,796 INFO L124 PetriNetUnfolderBase]: 14/188 cut-off events. [2023-08-26 12:56:02,796 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 12:56:02,803 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 12:56:02,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 12:56:02,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 171 transitions, 378 flow [2023-08-26 12:56:02,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:56:02,820 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 12:56:02,822 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 12:56:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 171 transitions, 378 flow [2023-08-26 12:56:02,864 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-08-26 12:56:02,865 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 12:56:02,869 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 12:56:02,871 INFO L119 LiptonReduction]: Number of co-enabled transitions 3780 [2023-08-26 12:56:09,512 INFO L134 LiptonReduction]: Checked pairs total: 4909 [2023-08-26 12:56:09,512 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-26 12:56:09,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:56:09,529 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;@216bf10e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:56:09,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 12:56:09,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:56:09,530 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:56:09,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:56:09,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:09,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:56:09,531 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 12:56:09,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 685, now seen corresponding path program 1 times [2023-08-26 12:56:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236079363] [2023-08-26 12:56:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236079363] [2023-08-26 12:56:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236079363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:56:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345453557] [2023-08-26 12:56:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:09,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:56:09,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:56:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:56:09,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 361 [2023-08-26 12:56:09,654 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 12:56:09,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:09,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 361 [2023-08-26 12:56:09,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:10,025 INFO L124 PetriNetUnfolderBase]: 3537/4292 cut-off events. [2023-08-26 12:56:10,025 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-08-26 12:56:10,032 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 12:56:10,053 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 59 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-26 12:56:10,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 272 flow [2023-08-26 12:56:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:56:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:56:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2023-08-26 12:56:10,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5637119113573407 [2023-08-26 12:56:10,073 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2023-08-26 12:56:10,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2023-08-26 12:56:10,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:10,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2023-08-26 12:56:10,082 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 12:56:10,086 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 12:56:10,087 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 12:56:10,088 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 158 flow. Second operand 2 states and 407 transitions. [2023-08-26 12:56:10,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 272 flow [2023-08-26 12:56:10,096 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 12:56:10,098 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 130 flow [2023-08-26 12:56:10,100 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 12:56:10,103 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 12:56:10,103 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 130 flow [2023-08-26 12:56:10,104 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 12:56:10,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:10,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:56:10,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:56:10,104 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 12:56:10,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 672761, now seen corresponding path program 1 times [2023-08-26 12:56:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865663022] [2023-08-26 12:56:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865663022] [2023-08-26 12:56:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865663022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:10,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161638664] [2023-08-26 12:56:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:10,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:10,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 12:56:10,703 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 12:56:10,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:10,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 12:56:10,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:10,967 INFO L124 PetriNetUnfolderBase]: 3375/4096 cut-off events. [2023-08-26 12:56:10,968 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:10,972 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 12:56:10,989 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 56 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-26 12:56:10,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 240 flow [2023-08-26 12:56:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-26 12:56:10,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312096029547553 [2023-08-26 12:56:10,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-26 12:56:10,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-26 12:56:10,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:10,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-26 12:56:10,993 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 12:56:10,995 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 12:56:10,996 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 12:56:10,996 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 130 flow. Second operand 3 states and 467 transitions. [2023-08-26 12:56:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 240 flow [2023-08-26 12:56:10,997 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 12:56:10,999 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 128 flow [2023-08-26 12:56:11,000 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 12:56:11,000 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 12:56:11,001 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 128 flow [2023-08-26 12:56:11,001 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 12:56:11,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:11,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:56:11,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:56:11,001 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 12:56:11,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash 672762, now seen corresponding path program 1 times [2023-08-26 12:56:11,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:11,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802015378] [2023-08-26 12:56:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802015378] [2023-08-26 12:56:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802015378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498007522] [2023-08-26 12:56:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:11,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 12:56:11,159 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 12:56:11,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:11,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 12:56:11,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:11,469 INFO L124 PetriNetUnfolderBase]: 3213/3900 cut-off events. [2023-08-26 12:56:11,469 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:11,473 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 12:56:11,489 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 54 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 12:56:11,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2023-08-26 12:56:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-08-26 12:56:11,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41274238227146814 [2023-08-26 12:56:11,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-08-26 12:56:11,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-08-26 12:56:11,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:11,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-08-26 12:56:11,494 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 12:56:11,495 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 12:56:11,496 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 12:56:11,496 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 128 flow. Second operand 3 states and 447 transitions. [2023-08-26 12:56:11,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2023-08-26 12:56:11,497 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 12:56:11,498 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 125 flow [2023-08-26 12:56:11,499 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 12:56:11,500 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 12:56:11,500 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 125 flow [2023-08-26 12:56:11,500 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 12:56:11,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:11,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:56:11,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:56:11,504 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 12:56:11,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash 646540505, now seen corresponding path program 1 times [2023-08-26 12:56:11,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:11,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73841291] [2023-08-26 12:56:11,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73841291] [2023-08-26 12:56:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73841291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:11,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:11,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757254834] [2023-08-26 12:56:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:11,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 12:56:11,801 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 12:56:11,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:11,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 12:56:11,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:12,035 INFO L124 PetriNetUnfolderBase]: 3141/3808 cut-off events. [2023-08-26 12:56:12,035 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:12,040 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 12:56:12,057 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 52 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 12:56:12,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 227 flow [2023-08-26 12:56:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 12:56:12,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41089566020313945 [2023-08-26 12:56:12,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 12:56:12,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 12:56:12,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:12,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 12:56:12,061 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 12:56:12,063 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 12:56:12,064 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 12:56:12,064 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 125 flow. Second operand 3 states and 445 transitions. [2023-08-26 12:56:12,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 227 flow [2023-08-26 12:56:12,065 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 12:56:12,066 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 122 flow [2023-08-26 12:56:12,066 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 12:56:12,068 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 12:56:12,068 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 122 flow [2023-08-26 12:56:12,068 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 12:56:12,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:12,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:56:12,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:56:12,069 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 12:56:12,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 646540506, now seen corresponding path program 1 times [2023-08-26 12:56:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800516987] [2023-08-26 12:56:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800516987] [2023-08-26 12:56:12,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800516987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:12,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:12,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960227528] [2023-08-26 12:56:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:12,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 12:56:12,346 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 12:56:12,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:12,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 12:56:12,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:12,589 INFO L124 PetriNetUnfolderBase]: 3069/3716 cut-off events. [2023-08-26 12:56:12,589 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:12,593 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 12:56:12,609 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 50 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 12:56:12,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 220 flow [2023-08-26 12:56:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-26 12:56:12,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42566943674976915 [2023-08-26 12:56:12,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-26 12:56:12,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-26 12:56:12,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:12,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-26 12:56:12,613 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 12:56:12,615 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 12:56:12,616 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 12:56:12,616 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 122 flow. Second operand 3 states and 461 transitions. [2023-08-26 12:56:12,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 220 flow [2023-08-26 12:56:12,617 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 12:56:12,619 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-26 12:56:12,619 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 12:56:12,621 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 12:56:12,621 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-26 12:56:12,622 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 12:56:12,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:12,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:12,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:56:12,622 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 12:56:12,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1444818079, now seen corresponding path program 1 times [2023-08-26 12:56:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689788009] [2023-08-26 12:56:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689788009] [2023-08-26 12:56:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689788009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:12,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216505996] [2023-08-26 12:56:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:12,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 12:56:12,815 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 12:56:12,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:12,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 12:56:12,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:13,027 INFO L124 PetriNetUnfolderBase]: 3021/3652 cut-off events. [2023-08-26 12:56:13,027 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:13,032 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 12:56:13,044 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 48 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-26 12:56:13,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 213 flow [2023-08-26 12:56:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-26 12:56:13,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.407202216066482 [2023-08-26 12:56:13,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-26 12:56:13,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-26 12:56:13,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:13,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-26 12:56:13,048 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 12:56:13,050 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 12:56:13,051 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 12:56:13,051 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 3 states and 441 transitions. [2023-08-26 12:56:13,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 213 flow [2023-08-26 12:56:13,052 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 12:56:13,052 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 116 flow [2023-08-26 12:56:13,053 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 12:56:13,055 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 12:56:13,055 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 116 flow [2023-08-26 12:56:13,055 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 12:56:13,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:13,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:56:13,056 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 12:56:13,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1444818081, now seen corresponding path program 1 times [2023-08-26 12:56:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051644119] [2023-08-26 12:56:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051644119] [2023-08-26 12:56:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051644119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:13,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132712131] [2023-08-26 12:56:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:13,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:13,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 12:56:13,224 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 12:56:13,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:13,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 12:56:13,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:13,417 INFO L124 PetriNetUnfolderBase]: 2973/3588 cut-off events. [2023-08-26 12:56:13,417 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:13,422 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 12:56:13,433 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 46 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 12:56:13,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 206 flow [2023-08-26 12:56:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-26 12:56:13,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42197599261311175 [2023-08-26 12:56:13,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-26 12:56:13,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-26 12:56:13,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:13,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-26 12:56:13,437 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 12:56:13,441 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 12:56:13,441 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 12:56:13,441 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 116 flow. Second operand 3 states and 457 transitions. [2023-08-26 12:56:13,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 206 flow [2023-08-26 12:56:13,442 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 12:56:13,443 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 113 flow [2023-08-26 12:56:13,443 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 12:56:13,445 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-08-26 12:56:13,445 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 113 flow [2023-08-26 12:56:13,445 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 12:56:13,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:13,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:13,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:56:13,446 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 12:56:13,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1195722952, now seen corresponding path program 1 times [2023-08-26 12:56:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122820665] [2023-08-26 12:56:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:13,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:13,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122820665] [2023-08-26 12:56:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122820665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421399031] [2023-08-26 12:56:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:13,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:13,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 12:56:13,504 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 12:56:13,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:13,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 12:56:13,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:13,709 INFO L124 PetriNetUnfolderBase]: 2901/3496 cut-off events. [2023-08-26 12:56:13,709 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:13,714 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 12:56:13,724 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 44 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 12:56:13,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 199 flow [2023-08-26 12:56:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-26 12:56:13,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2023-08-26 12:56:13,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-26 12:56:13,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-26 12:56:13,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:13,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-26 12:56:13,728 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 12:56:13,729 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 12:56:13,730 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 12:56:13,730 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 113 flow. Second operand 3 states and 437 transitions. [2023-08-26 12:56:13,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 199 flow [2023-08-26 12:56:13,730 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 12:56:13,733 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 110 flow [2023-08-26 12:56:13,733 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 12:56:13,734 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-08-26 12:56:13,734 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 110 flow [2023-08-26 12:56:13,735 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 12:56:13,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:13,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:13,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:56:13,735 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 12:56:13,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1195722950, now seen corresponding path program 1 times [2023-08-26 12:56:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705123256] [2023-08-26 12:56:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:13,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705123256] [2023-08-26 12:56:13,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705123256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:13,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:13,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:13,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062794171] [2023-08-26 12:56:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:13,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:13,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:13,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 12:56:13,829 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 12:56:13,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:13,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 12:56:13,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:14,013 INFO L124 PetriNetUnfolderBase]: 2829/3404 cut-off events. [2023-08-26 12:56:14,013 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:14,018 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 12:56:14,028 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 42 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 12:56:14,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 192 flow [2023-08-26 12:56:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-26 12:56:14,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182825484764543 [2023-08-26 12:56:14,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-26 12:56:14,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-26 12:56:14,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:14,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-26 12:56:14,033 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 12:56:14,034 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 12:56:14,035 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 12:56:14,035 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 110 flow. Second operand 3 states and 453 transitions. [2023-08-26 12:56:14,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 192 flow [2023-08-26 12:56:14,036 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 12:56:14,036 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 107 flow [2023-08-26 12:56:14,037 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 12:56:14,037 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 12:56:14,037 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 107 flow [2023-08-26 12:56:14,038 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 12:56:14,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:14,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:14,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:56:14,038 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 12:56:14,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1961494981, now seen corresponding path program 1 times [2023-08-26 12:56:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634386480] [2023-08-26 12:56:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634386480] [2023-08-26 12:56:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634386480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420496012] [2023-08-26 12:56:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:14,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:14,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2023-08-26 12:56:14,094 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 12:56:14,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:14,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2023-08-26 12:56:14,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:14,282 INFO L124 PetriNetUnfolderBase]: 2667/3208 cut-off events. [2023-08-26 12:56:14,282 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:14,287 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 12:56:14,296 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 40 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 12:56:14,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow [2023-08-26 12:56:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 12:56:14,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39981532779316714 [2023-08-26 12:56:14,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 12:56:14,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 12:56:14,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:14,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 12:56:14,299 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 12:56:14,301 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 12:56:14,301 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 12:56:14,301 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 107 flow. Second operand 3 states and 433 transitions. [2023-08-26 12:56:14,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow [2023-08-26 12:56:14,302 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 12:56:14,303 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 104 flow [2023-08-26 12:56:14,304 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 12:56:14,305 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 12:56:14,305 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 104 flow [2023-08-26 12:56:14,305 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 12:56:14,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:14,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:14,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:56:14,305 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 12:56:14,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1961494983, now seen corresponding path program 1 times [2023-08-26 12:56:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787550323] [2023-08-26 12:56:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787550323] [2023-08-26 12:56:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787550323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127393206] [2023-08-26 12:56:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:14,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 361 [2023-08-26 12:56:14,379 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 12:56:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:14,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 361 [2023-08-26 12:56:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:14,546 INFO L124 PetriNetUnfolderBase]: 2505/3012 cut-off events. [2023-08-26 12:56:14,546 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:14,551 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 12:56:14,559 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 38 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 12:56:14,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 178 flow [2023-08-26 12:56:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 12:56:14,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458910433979684 [2023-08-26 12:56:14,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 12:56:14,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 12:56:14,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:14,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 12:56:14,563 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 12:56:14,564 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 12:56:14,565 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 12:56:14,565 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-26 12:56:14,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 178 flow [2023-08-26 12:56:14,565 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 12:56:14,566 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 101 flow [2023-08-26 12:56:14,566 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 12:56:14,566 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 12:56:14,566 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 101 flow [2023-08-26 12:56:14,567 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 12:56:14,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:14,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:56:14,567 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 12:56:14,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash -493949905, now seen corresponding path program 1 times [2023-08-26 12:56:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891876630] [2023-08-26 12:56:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891876630] [2023-08-26 12:56:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891876630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:56:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042630144] [2023-08-26 12:56:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:56:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:56:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:56:14,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 361 [2023-08-26 12:56:14,936 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 12:56:14,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:14,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 361 [2023-08-26 12:56:14,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:15,094 INFO L124 PetriNetUnfolderBase]: 2121/2564 cut-off events. [2023-08-26 12:56:15,096 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:15,100 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 12:56:15,107 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 37 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 12:56:15,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 175 flow [2023-08-26 12:56:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 12:56:15,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3545706371191136 [2023-08-26 12:56:15,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 12:56:15,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 12:56:15,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:15,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 12:56:15,111 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 12:56:15,112 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 12:56:15,113 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 12:56:15,113 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 101 flow. Second operand 3 states and 384 transitions. [2023-08-26 12:56:15,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 175 flow [2023-08-26 12:56:15,113 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 12:56:15,114 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 100 flow [2023-08-26 12:56:15,114 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 12:56:15,115 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 12:56:15,115 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 100 flow [2023-08-26 12:56:15,115 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 12:56:15,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:15,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:56:15,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:56:15,116 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 12:56:15,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -493949907, now seen corresponding path program 1 times [2023-08-26 12:56:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244831747] [2023-08-26 12:56:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:15,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244831747] [2023-08-26 12:56:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244831747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:56:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318699845] [2023-08-26 12:56:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:56:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:56:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:56:15,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 361 [2023-08-26 12:56:15,798 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 12:56:15,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:15,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 361 [2023-08-26 12:56:15,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:15,933 INFO L124 PetriNetUnfolderBase]: 1737/2116 cut-off events. [2023-08-26 12:56:15,933 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:56:15,937 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 12:56:15,943 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 12:56:15,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 172 flow [2023-08-26 12:56:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 12:56:15,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3785780240073869 [2023-08-26 12:56:15,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 12:56:15,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 12:56:15,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:15,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 12:56:15,946 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 12:56:15,948 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 12:56:15,948 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 12:56:15,948 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 100 flow. Second operand 3 states and 410 transitions. [2023-08-26 12:56:15,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 172 flow [2023-08-26 12:56:15,949 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 12:56:15,949 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 99 flow [2023-08-26 12:56:15,949 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 12:56:15,950 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 12:56:15,950 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 99 flow [2023-08-26 12:56:15,950 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 12:56:15,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:15,950 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 12:56:15,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:56:15,950 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 12:56:15,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash -15168890, now seen corresponding path program 1 times [2023-08-26 12:56:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542416885] [2023-08-26 12:56:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:56:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542416885] [2023-08-26 12:56:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542416885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:56:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994490316] [2023-08-26 12:56:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:56:16,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 12:56:16,221 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 12:56:16,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:16,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 12:56:16,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:16,533 INFO L124 PetriNetUnfolderBase]: 3277/3973 cut-off events. [2023-08-26 12:56:16,533 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-26 12:56:16,541 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 12:56:16,551 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 59 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-26 12:56:16,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 284 flow [2023-08-26 12:56:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2023-08-26 12:56:16,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050784856879039 [2023-08-26 12:56:16,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2023-08-26 12:56:16,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2023-08-26 12:56:16,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:16,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2023-08-26 12:56:16,555 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 12:56:16,556 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 12:56:16,557 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 12:56:16,557 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 99 flow. Second operand 3 states and 547 transitions. [2023-08-26 12:56:16,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 284 flow [2023-08-26 12:56:16,558 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 12:56:16,558 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 117 flow [2023-08-26 12:56:16,559 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 12:56:16,559 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 12:56:16,559 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 117 flow [2023-08-26 12:56:16,559 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 12:56:16,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:16,560 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 12:56:16,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:56:16,560 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 12:56:16,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1901196965, now seen corresponding path program 1 times [2023-08-26 12:56:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234733387] [2023-08-26 12:56:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:16,764 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 12:56:16,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:16,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234733387] [2023-08-26 12:56:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234733387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:16,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:16,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:56:16,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356118040] [2023-08-26 12:56:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:16,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:56:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:16,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:56:16,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:56:16,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:16,767 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 12:56:16,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:16,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:16,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:17,162 INFO L124 PetriNetUnfolderBase]: 3213/3909 cut-off events. [2023-08-26 12:56:17,162 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2023-08-26 12:56:17,168 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 12:56:17,175 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 92 selfloop transitions, 6 changer transitions 8/106 dead transitions. [2023-08-26 12:56:17,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 485 flow [2023-08-26 12:56:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2023-08-26 12:56:17,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775623268698061 [2023-08-26 12:56:17,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2023-08-26 12:56:17,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2023-08-26 12:56:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:17,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2023-08-26 12:56:17,181 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 12:56:17,183 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 12:56:17,183 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 12:56:17,183 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 117 flow. Second operand 5 states and 862 transitions. [2023-08-26 12:56:17,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 485 flow [2023-08-26 12:56:17,184 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 12:56:17,185 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 138 flow [2023-08-26 12:56:17,185 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 12:56:17,186 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 12:56:17,186 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 138 flow [2023-08-26 12:56:17,186 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 12:56:17,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:17,186 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 12:56:17,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:56:17,187 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 12:56:17,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -85369956, now seen corresponding path program 1 times [2023-08-26 12:56:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006367638] [2023-08-26 12:56:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:17,401 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 12:56:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006367638] [2023-08-26 12:56:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006367638] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404834844] [2023-08-26 12:56:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:17,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:17,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:17,409 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 12:56:17,430 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 12:56:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:17,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 12:56:17,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:17,743 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 12:56:17,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 12:56:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404834844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 12:56:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 12:56:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756730581] [2023-08-26 12:56:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:17,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:17,745 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 12:56:17,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:17,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:17,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:18,247 INFO L124 PetriNetUnfolderBase]: 5493/6691 cut-off events. [2023-08-26 12:56:18,247 INFO L125 PetriNetUnfolderBase]: For 2542/2542 co-relation queries the response was YES. [2023-08-26 12:56:18,259 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 12:56:18,276 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 69 selfloop transitions, 5 changer transitions 5/79 dead transitions. [2023-08-26 12:56:18,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 408 flow [2023-08-26 12:56:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-26 12:56:18,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48476454293628807 [2023-08-26 12:56:18,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-26 12:56:18,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-26 12:56:18,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:18,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-26 12:56:18,280 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 12:56:18,281 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 12:56:18,281 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 12:56:18,282 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 138 flow. Second operand 3 states and 525 transitions. [2023-08-26 12:56:18,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 408 flow [2023-08-26 12:56:18,287 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 12:56:18,288 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 167 flow [2023-08-26 12:56:18,288 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 12:56:18,288 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 12:56:18,288 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 167 flow [2023-08-26 12:56:18,288 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 12:56:18,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:18,289 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 12:56:18,300 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 12:56:18,495 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 12:56:18,496 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 12:56:18,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 423726592, now seen corresponding path program 1 times [2023-08-26 12:56:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114692740] [2023-08-26 12:56:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:18,710 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 12:56:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114692740] [2023-08-26 12:56:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114692740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424662507] [2023-08-26 12:56:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:18,711 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 12:56:18,723 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 12:56:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:18,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 12:56:18,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:18,931 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 12:56:18,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 12:56:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424662507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 12:56:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 12:56:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389706417] [2023-08-26 12:56:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:18,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:18,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:18,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:18,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 12:56:18,934 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 12:56:18,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:18,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 12:56:18,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:19,586 INFO L124 PetriNetUnfolderBase]: 8219/10003 cut-off events. [2023-08-26 12:56:19,586 INFO L125 PetriNetUnfolderBase]: For 4397/4397 co-relation queries the response was YES. [2023-08-26 12:56:19,610 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 12:56:19,636 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 69 selfloop transitions, 5 changer transitions 9/83 dead transitions. [2023-08-26 12:56:19,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 450 flow [2023-08-26 12:56:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2023-08-26 12:56:19,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124653739612188 [2023-08-26 12:56:19,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2023-08-26 12:56:19,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2023-08-26 12:56:19,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:19,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2023-08-26 12:56:19,640 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 12:56:19,642 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 12:56:19,642 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 12:56:19,642 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 167 flow. Second operand 3 states and 555 transitions. [2023-08-26 12:56:19,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 450 flow [2023-08-26 12:56:19,644 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 12:56:19,645 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 191 flow [2023-08-26 12:56:19,646 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 12:56:19,646 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-08-26 12:56:19,646 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 191 flow [2023-08-26 12:56:19,646 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 12:56:19,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:19,646 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 12:56:19,655 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 12:56:19,855 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 12:56:19,855 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 12:56:19,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1361077693, now seen corresponding path program 1 times [2023-08-26 12:56:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769491447] [2023-08-26 12:56:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:20,032 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 12:56:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769491447] [2023-08-26 12:56:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769491447] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493680829] [2023-08-26 12:56:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:20,034 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 12:56:20,057 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 12:56:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:20,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 12:56:20,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:20,252 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 12:56:20,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 12:56:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493680829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:20,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 12:56:20,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-26 12:56:20,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584136509] [2023-08-26 12:56:20,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:20,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:56:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:56:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:20,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 361 [2023-08-26 12:56:20,256 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 12:56:20,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:20,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 361 [2023-08-26 12:56:20,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:21,188 INFO L124 PetriNetUnfolderBase]: 10945/13315 cut-off events. [2023-08-26 12:56:21,188 INFO L125 PetriNetUnfolderBase]: For 8531/8531 co-relation queries the response was YES. [2023-08-26 12:56:21,245 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 12:56:21,286 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 71 selfloop transitions, 5 changer transitions 5/81 dead transitions. [2023-08-26 12:56:21,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 464 flow [2023-08-26 12:56:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:56:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:56:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2023-08-26 12:56:21,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-26 12:56:21,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2023-08-26 12:56:21,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2023-08-26 12:56:21,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:21,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2023-08-26 12:56:21,289 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 12:56:21,291 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 12:56:21,291 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 12:56:21,291 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 191 flow. Second operand 3 states and 551 transitions. [2023-08-26 12:56:21,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 464 flow [2023-08-26 12:56:21,296 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 12:56:21,297 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 215 flow [2023-08-26 12:56:21,297 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 12:56:21,297 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-08-26 12:56:21,297 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 215 flow [2023-08-26 12:56:21,298 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 12:56:21,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:21,298 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 12:56:21,307 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 12:56:21,504 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 12:56:21,504 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 12:56:21,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1985544085, now seen corresponding path program 1 times [2023-08-26 12:56:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935264178] [2023-08-26 12:56:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:21,670 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 12:56:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935264178] [2023-08-26 12:56:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935264178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180217627] [2023-08-26 12:56:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:21,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:21,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:21,672 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 12:56:21,701 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 12:56:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:21,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:56:21,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:21,897 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 12:56:21,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:21,951 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 12:56:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180217627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:21,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 12:56:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928340446] [2023-08-26 12:56:21,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:56:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:56:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:21,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:21,955 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 12:56:21,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:21,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:23,486 INFO L124 PetriNetUnfolderBase]: 15929/19479 cut-off events. [2023-08-26 12:56:23,487 INFO L125 PetriNetUnfolderBase]: For 16592/16592 co-relation queries the response was YES. [2023-08-26 12:56:23,541 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 12:56:23,579 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 121 selfloop transitions, 8 changer transitions 19/148 dead transitions. [2023-08-26 12:56:23,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 148 transitions, 857 flow [2023-08-26 12:56:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 880 transitions. [2023-08-26 12:56:23,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48753462603878117 [2023-08-26 12:56:23,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 880 transitions. [2023-08-26 12:56:23,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 880 transitions. [2023-08-26 12:56:23,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:23,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 880 transitions. [2023-08-26 12:56:23,584 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 12:56:23,587 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 12:56:23,599 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 12:56:23,599 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 215 flow. Second operand 5 states and 880 transitions. [2023-08-26 12:56:23,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 148 transitions, 857 flow [2023-08-26 12:56:23,602 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 12:56:23,606 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 256 flow [2023-08-26 12:56:23,606 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 12:56:23,606 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-08-26 12:56:23,606 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 256 flow [2023-08-26 12:56:23,607 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 12:56:23,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:23,607 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 12:56:23,614 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 12:56:23,813 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 12:56:23,813 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 12:56:23,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -618853735, now seen corresponding path program 1 times [2023-08-26 12:56:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612351142] [2023-08-26 12:56:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:24,010 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 12:56:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612351142] [2023-08-26 12:56:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612351142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776555515] [2023-08-26 12:56:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:24,012 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 12:56:24,033 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 12:56:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:24,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:56:24,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:24,283 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 12:56:24,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:24,348 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 12:56:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776555515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:24,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 12:56:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865713911] [2023-08-26 12:56:24,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:24,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:56:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:56:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:24,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:24,351 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 12:56:24,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:24,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:24,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:26,250 INFO L124 PetriNetUnfolderBase]: 22301/27369 cut-off events. [2023-08-26 12:56:26,250 INFO L125 PetriNetUnfolderBase]: For 44567/44567 co-relation queries the response was YES. [2023-08-26 12:56:26,324 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 12:56:26,373 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 138 selfloop transitions, 6 changer transitions 7/151 dead transitions. [2023-08-26 12:56:26,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 1036 flow [2023-08-26 12:56:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2023-08-26 12:56:26,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47867036011080333 [2023-08-26 12:56:26,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2023-08-26 12:56:26,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2023-08-26 12:56:26,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:26,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2023-08-26 12:56:26,378 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 12:56:26,380 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 12:56:26,380 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 12:56:26,380 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 256 flow. Second operand 5 states and 864 transitions. [2023-08-26 12:56:26,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 1036 flow [2023-08-26 12:56:26,393 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 12:56:26,395 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 278 flow [2023-08-26 12:56:26,395 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 12:56:26,395 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-08-26 12:56:26,395 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 278 flow [2023-08-26 12:56:26,396 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 12:56:26,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:26,396 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 12:56:26,405 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 12:56:26,601 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 12:56:26,602 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 12:56:26,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2052743492, now seen corresponding path program 1 times [2023-08-26 12:56:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20298299] [2023-08-26 12:56:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:26,784 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 12:56:26,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20298299] [2023-08-26 12:56:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20298299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:56:26,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832817004] [2023-08-26 12:56:26,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:26,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:56:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:26,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:56:26,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:56:26,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:26,789 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 12:56:26,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:26,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:26,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:28,286 INFO L124 PetriNetUnfolderBase]: 16015/19559 cut-off events. [2023-08-26 12:56:28,286 INFO L125 PetriNetUnfolderBase]: For 38021/38021 co-relation queries the response was YES. [2023-08-26 12:56:28,336 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 12:56:28,373 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 99 selfloop transitions, 6 changer transitions 44/149 dead transitions. [2023-08-26 12:56:28,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 998 flow [2023-08-26 12:56:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 870 transitions. [2023-08-26 12:56:28,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481994459833795 [2023-08-26 12:56:28,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 870 transitions. [2023-08-26 12:56:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 870 transitions. [2023-08-26 12:56:28,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:28,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 870 transitions. [2023-08-26 12:56:28,378 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 12:56:28,380 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 12:56:28,380 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 12:56:28,381 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 278 flow. Second operand 5 states and 870 transitions. [2023-08-26 12:56:28,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 998 flow [2023-08-26 12:56:28,425 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 12:56:28,427 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 286 flow [2023-08-26 12:56:28,427 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 12:56:28,427 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-08-26 12:56:28,427 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 286 flow [2023-08-26 12:56:28,428 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 12:56:28,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:28,428 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 12:56:28,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:56:28,428 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 12:56:28,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash 692702100, now seen corresponding path program 1 times [2023-08-26 12:56:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:28,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880072426] [2023-08-26 12:56:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:28,634 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 12:56:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880072426] [2023-08-26 12:56:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880072426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:28,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:28,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:56:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180311679] [2023-08-26 12:56:28,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:28,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:56:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:56:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:56:28,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:28,637 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 12:56:28,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:28,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:28,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:29,656 INFO L124 PetriNetUnfolderBase]: 10911/13143 cut-off events. [2023-08-26 12:56:29,656 INFO L125 PetriNetUnfolderBase]: For 25833/25833 co-relation queries the response was YES. [2023-08-26 12:56:29,680 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 12:56:29,714 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 137 selfloop transitions, 6 changer transitions 0/143 dead transitions. [2023-08-26 12:56:29,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 143 transitions, 1061 flow [2023-08-26 12:56:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 12:56:29,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 12:56:29,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 12:56:29,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 12:56:29,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:29,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 12:56:29,719 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 12:56:29,721 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 12:56:29,722 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 12:56:29,722 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 286 flow. Second operand 5 states and 853 transitions. [2023-08-26 12:56:29,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 143 transitions, 1061 flow [2023-08-26 12:56:29,766 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 12:56:29,768 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 316 flow [2023-08-26 12:56:29,768 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 12:56:29,768 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-08-26 12:56:29,768 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 316 flow [2023-08-26 12:56:29,769 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 12:56:29,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:29,769 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 12:56:29,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:56:29,769 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 12:56:29,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash -311684484, now seen corresponding path program 1 times [2023-08-26 12:56:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734181952] [2023-08-26 12:56:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:29,906 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 12:56:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734181952] [2023-08-26 12:56:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734181952] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354185132] [2023-08-26 12:56:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:29,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:29,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:29,909 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 12:56:29,919 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 12:56:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:30,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:56:30,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:30,116 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 12:56:30,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:30,156 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 12:56:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354185132] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:30,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 12:56:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684667273] [2023-08-26 12:56:30,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:30,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:56:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:56:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:30,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:30,159 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 12:56:30,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:30,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:30,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:31,440 INFO L124 PetriNetUnfolderBase]: 13159/15827 cut-off events. [2023-08-26 12:56:31,440 INFO L125 PetriNetUnfolderBase]: For 38809/38809 co-relation queries the response was YES. [2023-08-26 12:56:31,476 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 12:56:31,636 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 133 selfloop transitions, 8 changer transitions 0/141 dead transitions. [2023-08-26 12:56:31,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 1057 flow [2023-08-26 12:56:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 12:56:31,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 12:56:31,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 12:56:31,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 12:56:31,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:31,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 12:56:31,649 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 12:56:31,651 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 12:56:31,651 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 12:56:31,651 INFO L175 Difference]: Start difference. First operand has 81 places, 56 transitions, 316 flow. Second operand 5 states and 853 transitions. [2023-08-26 12:56:31,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 1057 flow [2023-08-26 12:56:31,687 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 12:56:31,689 INFO L231 Difference]: Finished difference. Result has 86 places, 59 transitions, 353 flow [2023-08-26 12:56:31,689 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 12:56:31,689 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2023-08-26 12:56:31,690 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 59 transitions, 353 flow [2023-08-26 12:56:31,690 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 12:56:31,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:31,690 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 12:56:31,696 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 12:56:31,894 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 12:56:31,894 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 12:56:31,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -382240083, now seen corresponding path program 1 times [2023-08-26 12:56:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540036074] [2023-08-26 12:56:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:32,094 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 12:56:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:32,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540036074] [2023-08-26 12:56:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540036074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:56:32,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:56:32,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:56:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063247159] [2023-08-26 12:56:32,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:56:32,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:56:32,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:32,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:56:32,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:56:32,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:32,097 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 12:56:32,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:32,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:32,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:33,498 INFO L124 PetriNetUnfolderBase]: 12835/15503 cut-off events. [2023-08-26 12:56:33,498 INFO L125 PetriNetUnfolderBase]: For 54444/54444 co-relation queries the response was YES. [2023-08-26 12:56:33,545 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 12:56:33,599 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 156 selfloop transitions, 9 changer transitions 12/177 dead transitions. [2023-08-26 12:56:33,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 177 transitions, 1398 flow [2023-08-26 12:56:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-08-26 12:56:33,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47977839335180056 [2023-08-26 12:56:33,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-08-26 12:56:33,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-08-26 12:56:33,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:33,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-08-26 12:56:33,606 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 12:56:33,610 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 12:56:33,611 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 12:56:33,611 INFO L175 Difference]: Start difference. First operand has 86 places, 59 transitions, 353 flow. Second operand 5 states and 866 transitions. [2023-08-26 12:56:33,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 177 transitions, 1398 flow [2023-08-26 12:56:33,633 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 12:56:33,635 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 378 flow [2023-08-26 12:56:33,635 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 12:56:33,635 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-08-26 12:56:33,635 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 378 flow [2023-08-26 12:56:33,637 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 12:56:33,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:33,637 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 12:56:33,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 12:56:33,637 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 12:56:33,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2068628831, now seen corresponding path program 1 times [2023-08-26 12:56:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522002729] [2023-08-26 12:56:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:33,874 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 12:56:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522002729] [2023-08-26 12:56:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522002729] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357741233] [2023-08-26 12:56:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:33,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:33,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:33,876 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 12:56:33,878 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 12:56:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:34,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:56:34,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:34,128 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 12:56:34,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:34,210 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 12:56:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357741233] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:34,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:34,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 12:56:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557639237] [2023-08-26 12:56:34,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:34,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:56:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:56:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:34,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:34,215 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 12:56:34,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:34,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:34,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:35,705 INFO L124 PetriNetUnfolderBase]: 16972/20583 cut-off events. [2023-08-26 12:56:35,705 INFO L125 PetriNetUnfolderBase]: For 66172/66172 co-relation queries the response was YES. [2023-08-26 12:56:35,907 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 12:56:35,950 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 158 selfloop transitions, 8 changer transitions 16/182 dead transitions. [2023-08-26 12:56:35,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 182 transitions, 1410 flow [2023-08-26 12:56:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2023-08-26 12:56:35,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48310249307479225 [2023-08-26 12:56:35,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2023-08-26 12:56:35,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2023-08-26 12:56:35,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:35,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2023-08-26 12:56:35,955 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 12:56:35,957 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 12:56:35,958 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 12:56:35,958 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 378 flow. Second operand 5 states and 872 transitions. [2023-08-26 12:56:35,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 182 transitions, 1410 flow [2023-08-26 12:56:35,998 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 12:56:36,000 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 400 flow [2023-08-26 12:56:36,000 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 12:56:36,000 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2023-08-26 12:56:36,001 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 400 flow [2023-08-26 12:56:36,001 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 12:56:36,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:36,001 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 12:56:36,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 12:56:36,207 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 12:56:36,207 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 12:56:36,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1382979613, now seen corresponding path program 2 times [2023-08-26 12:56:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65880308] [2023-08-26 12:56:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:36,388 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 12:56:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65880308] [2023-08-26 12:56:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65880308] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086016298] [2023-08-26 12:56:36,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 12:56:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:36,390 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 12:56:36,412 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 12:56:36,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 12:56:36,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:56:36,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:56:36,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:36,697 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 12:56:36,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:36,765 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 12:56:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086016298] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:36,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-26 12:56:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622196910] [2023-08-26 12:56:36,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:36,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:56:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:56:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:56:36,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 361 [2023-08-26 12:56:36,768 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 12:56:36,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:36,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 361 [2023-08-26 12:56:36,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:38,267 INFO L124 PetriNetUnfolderBase]: 14584/17497 cut-off events. [2023-08-26 12:56:38,267 INFO L125 PetriNetUnfolderBase]: For 55860/55860 co-relation queries the response was YES. [2023-08-26 12:56:38,309 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 12:56:38,359 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 157 selfloop transitions, 8 changer transitions 0/165 dead transitions. [2023-08-26 12:56:38,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 1359 flow [2023-08-26 12:56:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:56:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:56:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-26 12:56:38,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257617728531853 [2023-08-26 12:56:38,362 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-26 12:56:38,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-26 12:56:38,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:56:38,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-26 12:56:38,364 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 12:56:38,366 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 12:56:38,366 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 12:56:38,366 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 400 flow. Second operand 5 states and 853 transitions. [2023-08-26 12:56:38,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 1359 flow [2023-08-26 12:56:38,458 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 12:56:38,460 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 437 flow [2023-08-26 12:56:38,460 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 12:56:38,460 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 25 predicate places. [2023-08-26 12:56:38,461 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 437 flow [2023-08-26 12:56:38,461 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 12:56:38,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:56:38,461 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 12:56:38,467 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 12:56:38,667 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 12:56:38,667 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 12:56:38,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:56:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1492221821, now seen corresponding path program 1 times [2023-08-26 12:56:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:56:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981043324] [2023-08-26 12:56:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:56:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:39,620 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 12:56:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:56:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981043324] [2023-08-26 12:56:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981043324] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:56:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759662096] [2023-08-26 12:56:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:56:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:56:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:56:39,625 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 12:56:39,627 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 12:56:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:56:40,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 12:56:40,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:56:41,984 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 12:56:41,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:42,720 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 12:56:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759662096] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:42,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-08-26 12:56:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910323234] [2023-08-26 12:56:42,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:42,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 12:56:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 12:56:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-08-26 12:56:42,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 361 [2023-08-26 12:56:42,726 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 12:56:42,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:42,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 361 [2023-08-26 12:56:42,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:45,183 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 12:56:48,509 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 12:56:50,513 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 12:56:55,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:57:01,671 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 12:57:04,415 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 12:57:29,416 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 12:57:38,526 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 12:57:40,612 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 12:57:46,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:58:16,443 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 12:58:44,159 WARN L234 SmtUtils]: Spent 5.09s 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 12:59:41,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 12:59:43,306 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 12:59:45,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 13:00:12,643 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 13:00:14,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 13:00:16,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:00:26,504 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 13:00:29,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:01:09,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:01:19,900 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 13:01:30,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:01:33,746 INFO L124 PetriNetUnfolderBase]: 110640/136474 cut-off events. [2023-08-26 13:01:33,746 INFO L125 PetriNetUnfolderBase]: For 548798/548798 co-relation queries the response was YES. [2023-08-26 13:01:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656547 conditions, 136474 events. 110640/136474 cut-off events. For 548798/548798 co-relation queries the response was YES. Maximal size of possible extension queue 2832. Compared 659661 event pairs, 1900 based on Foata normal form. 2929/139403 useless extension candidates. Maximal degree in co-relation 656516. Up to 45409 conditions per place. [2023-08-26 13:01:34,996 INFO L140 encePairwiseOnDemand]: 348/361 looper letters, 1202 selfloop transitions, 310 changer transitions 1008/2520 dead transitions. [2023-08-26 13:01:34,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 2520 transitions, 18696 flow [2023-08-26 13:01:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-08-26 13:01:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2023-08-26 13:01:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 14558 transitions. [2023-08-26 13:01:35,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45311089669768745 [2023-08-26 13:01:35,024 INFO L72 ComplementDD]: Start complementDD. Operand 89 states and 14558 transitions. [2023-08-26 13:01:35,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 14558 transitions. [2023-08-26 13:01:35,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:01:35,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 14558 transitions. [2023-08-26 13:01:35,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 90 states, 89 states have (on average 163.57303370786516) internal successors, (14558), 89 states have internal predecessors, (14558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:01:35,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 90 states, 90 states have (on average 361.0) internal successors, (32490), 90 states have internal predecessors, (32490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:01:35,080 INFO L81 ComplementDD]: Finished complementDD. Result has 90 states, 90 states have (on average 361.0) internal successors, (32490), 90 states have internal predecessors, (32490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:01:35,080 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 437 flow. Second operand 89 states and 14558 transitions. [2023-08-26 13:01:35,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 2520 transitions, 18696 flow [2023-08-26 13:01:44,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 2520 transitions, 18487 flow, removed 82 selfloop flow, removed 1 redundant places. [2023-08-26 13:01:44,314 INFO L231 Difference]: Finished difference. Result has 248 places, 402 transitions, 4628 flow [2023-08-26 13:01:44,315 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=89, PETRI_FLOW=4628, PETRI_PLACES=248, PETRI_TRANSITIONS=402} [2023-08-26 13:01:44,315 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 174 predicate places. [2023-08-26 13:01:44,315 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 402 transitions, 4628 flow [2023-08-26 13:01:44,316 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 13:01:44,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:01:44,316 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 13:01:44,327 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 13:01:44,522 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 13:01:44,523 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 13:01:44,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:01:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 952737379, now seen corresponding path program 2 times [2023-08-26 13:01:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:01:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680628777] [2023-08-26 13:01:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:01:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:01:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:01:45,339 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 13:01:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:01:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680628777] [2023-08-26 13:01:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680628777] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 13:01:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073863132] [2023-08-26 13:01:45,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 13:01:45,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:01:45,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:01:45,345 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 13:01:45,351 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 13:02:09,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 13:02:09,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 13:02:09,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-26 13:02:09,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:04:06,427 WARN L234 SmtUtils]: Spent 8.93s 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 13:05:03,179 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 13:05:03,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:05:41,836 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 13:05:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073863132] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 13:05:41,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 13:05:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 20 [2023-08-26 13:05:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016796110] [2023-08-26 13:05:41,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 13:05:41,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 13:05:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:05:41,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 13:05:41,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=295, Unknown=50, NotChecked=0, Total=462 [2023-08-26 13:05:41,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 361 [2023-08-26 13:05:41,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 402 transitions, 4628 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 13:05:41,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:05:41,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 361 [2023-08-26 13:05:41,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:05:45,091 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 13:05:47,098 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 13:05:53,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:05:55,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 13:06:01,220 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 13:06:03,237 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 13:06:05,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:06:07,458 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 13:06:09,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 13:06:11,484 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 13:06:13,490 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 13:06:15,501 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 13:06:17,504 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 13:06:20,143 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 13:06:22,243 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 13:06:24,247 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 13:06:26,252 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 13:06:28,307 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 13:06:30,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:06:33,198 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 13:06:35,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 13:06:37,552 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 13:06:56,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 13:06:58,032 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 13:07:02,212 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 13:07:04,481 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 13:07:06,499 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 13:07:08,516 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 13:07:16,055 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 13:07:18,695 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 13:07:20,828 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 13:07:22,833 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 13:07:25,039 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 13:07:27,047 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 13:07:29,054 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 13:07:31,065 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 13:07:33,089 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 13:07:35,095 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 13:07:37,100 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 13:07:39,112 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 13:07:41,117 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 13:07:43,126 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 13:07:45,132 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 13:07:47,137 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 13:07:49,141 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 13:07:51,145 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 13:07:53,158 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 13:07:55,220 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 13:07:57,229 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 13:07:59,236 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 13:08:01,240 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 13:08:03,251 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 13:08:05,258 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 13:08:07,322 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 13:08:10,029 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 13:08:16,371 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 13:08:18,388 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 13:08:20,402 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 13:08:35,767 WARN L234 SmtUtils]: Spent 13.92s 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 13:08:38,361 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 13:08:40,366 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 13:08:42,375 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 13:08:44,393 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 13:08:54,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 13:08:56,420 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 13:08:58,492 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 13:09:00,504 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* (- 1) c_~x3~0)) (.cse20 (mod c_~x4~0 2147483648)) (.cse21 (mod c_~x3~0 2147483648))) (let ((.cse8 (div c_~n~0 4294967296)) (.cse9 (* (div c_~x4~0 2147483648) 4294967296)) (.cse7 (* 2 c_~x4~0)) (.cse10 (* 3 c_~n~0)) (.cse2 (= .cse20 .cse21)) (.cse5 (* 2 .cse21)) (.cse6 (* .cse20 2)) (.cse4 (mod c_~x3~0 4294967296)) (.cse1 (mod c_~x2~0 4294967296)) (.cse18 (mod (* 4294967295 (div .cse11 2)) 4294967296)) (.cse19 (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296)) (.cse3 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (let ((.cse0 (mod c_~x1~0 4294967296))) (or (= .cse0 .cse1) .cse2 (<= .cse3 .cse4) (< .cse5 .cse3) (< .cse0 .cse3) (< .cse1 .cse3) (< .cse6 .cse3))) (<= (+ .cse7 (* 4294967296 .cse8)) (+ c_~x3~0 (* (div (+ .cse9 (* 4 c_~x4~0) (- 4) (* c_~x3~0 (- 3)) .cse10) 12884901888) 4294967296))) (<= (+ (* 12884901888 .cse8) 4 (* 6 c_~x4~0)) (+ .cse9 (* c_~x3~0 2) (* 8589934592 (div (+ .cse7 .cse11) 4294967296)) .cse10)) (= (mod c_~x1~0 2) 0) (let ((.cse17 (mod c_~x1~0 2147483648)) (.cse16 (mod c_~x2~0 2147483648))) (let ((.cse12 (* .cse16 2)) (.cse15 (* 2 .cse17)) (.cse13 (+ .cse1 1)) (.cse14 (+ .cse4 1))) (or .cse2 (< .cse12 .cse13) (< .cse5 .cse13) (< .cse12 .cse14) (< .cse5 .cse14) (< .cse15 .cse13) (= .cse16 .cse17) (< .cse15 .cse14) (< .cse6 .cse13) (< .cse6 .cse14)))) (= .cse18 (mod c_~x4~0 4294967296)) (<= .cse3 .cse1) (= .cse19 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (< .cse18 .cse3) (= (mod c_~x3~0 2) 0) (< .cse19 .cse3)))) is different from false [2023-08-26 13:09:02,522 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 13:09:04,716 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 13:09:06,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 13:09:08,802 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 13:09:20,889 WARN L234 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 13:09:22,897 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 13:09:24,910 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 13:09:30,278 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 13:09:32,328 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 13:09:34,391 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 13:09:36,415 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 13:09:38,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:09:40,230 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 13:09:42,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:09:44,337 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 13:09:46,376 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 13:09:48,386 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 13:09:50,414 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 13:09:52,424 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 13:09:54,580 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 13:09:58,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:10:00,748 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 13:10:02,809 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 13:10:04,846 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 13:10:06,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:10:08,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 13:10:09,610 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 13:10:09,618 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 13:10:10,630 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 13:10:10,811 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 13:10:10,817 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 13:10:10,819 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (30 of 31 remaining) [2023-08-26 13:10:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 13:10:10,819 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 13:10:10,820 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-08-26 13:10:10,820 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-08-26 13:10:10,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-08-26 13:10:10,822 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-08-26 13:10:10,824 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-08-26 13:10:10,824 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 31 remaining) [2023-08-26 13:10:10,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 31 remaining) [2023-08-26 13:10:10,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 31 remaining) [2023-08-26 13:10:10,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 31 remaining) [2023-08-26 13:10:10,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 31 remaining) [2023-08-26 13:10:10,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2023-08-26 13:10:10,825 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 13:10:10,828 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 13:10:10,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 13:10:10,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:10:10 BasicIcfg [2023-08-26 13:10:10,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 13:10:10,830 INFO L158 Benchmark]: Toolchain (without parser) took 849206.31ms. Allocated memory was 343.9MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 320.4MB in the beginning and 7.5GB in the end (delta: -7.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 13:10:10,830 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 343.9MB. Free memory is still 319.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 13:10:10,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 343.9MB. Free memory was 320.0MB in the beginning and 308.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 13:10:10,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.39ms. Allocated memory is still 343.9MB. Free memory was 308.5MB in the beginning and 306.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 13:10:10,831 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 343.9MB. Free memory was 306.8MB in the beginning and 305.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 13:10:10,831 INFO L158 Benchmark]: RCFGBuilder took 567.84ms. Allocated memory is still 343.9MB. Free memory was 305.1MB in the beginning and 283.9MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 13:10:10,831 INFO L158 Benchmark]: TraceAbstraction took 848332.46ms. Allocated memory was 343.9MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 283.3MB in the beginning and 7.5GB in the end (delta: -7.2GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 13:10:10,832 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.09ms. Allocated memory is still 343.9MB. Free memory is still 319.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 343.9MB. Free memory was 320.0MB in the beginning and 308.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.39ms. Allocated memory is still 343.9MB. Free memory was 308.5MB in the beginning and 306.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 343.9MB. Free memory was 306.8MB in the beginning and 305.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 567.84ms. Allocated memory is still 343.9MB. Free memory was 305.1MB in the beginning and 283.9MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 848332.46ms. Allocated memory was 343.9MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 283.3MB in the beginning and 7.5GB in the end (delta: -7.2GB). 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.7s, 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: 848.1s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 589.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 101 mSolverCounterUnknown, 2221 SdHoareTripleChecker+Valid, 285.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2221 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 283.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 99 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7331 IncrementalHoareTripleChecker+Invalid, 7644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 0 mSDtfsCounter, 7331 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 548 SyntacticMatches, 17 SemanticMatches, 188 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3705 ImplicationChecksByTransitivity, 399.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4628occurred in iteration=27, InterpolantAutomatonStates: 184, 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.2s SsaConstructionTime, 26.4s SatisfiabilityAnalysisTime, 221.4s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 17764 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