/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:16:55,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:16:55,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 19:16:55,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:16:55,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:16:55,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:16:55,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:16:55,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:16:55,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:16:55,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:16:55,290 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:16:55,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:16:55,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:16:55,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:16:55,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:16:55,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:16:55,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:16:55,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:16:55,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:16:55,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:16:55,292 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:16:55,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:16:55,296 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:16:55,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:16:55,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:16:55,296 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:16:55,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:16:55,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:16:55,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:16:55,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:16:55,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:16:55,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:16:55,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:16:55,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:16:55,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:16:55,298 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:16:55,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:16:55,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:16:55,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:16:55,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:16:55,617 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:16:55,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-26 19:16:56,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:16:56,940 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:16:56,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-26 19:16:56,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4d28a83/62f6e03b3277462d99ff33eeb38b3235/FLAGb58f4aca3 [2023-08-26 19:16:56,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4d28a83/62f6e03b3277462d99ff33eeb38b3235 [2023-08-26 19:16:56,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:16:56,957 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:16:56,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:56,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:16:56,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:16:56,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e491e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56, skipping insertion in model container [2023-08-26 19:16:56,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,974 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:16:57,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:57,102 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:16:57,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:57,141 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:16:57,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57 WrapperNode [2023-08-26 19:16:57,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:57,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:57,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:16:57,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:16:57,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,176 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 19:16:57,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:57,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:16:57,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:16:57,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:16:57,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:16:57,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:16:57,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:16:57,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:16:57,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (1/1) ... [2023-08-26 19:16:57,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:16:57,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:57,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 19:16:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 19:16:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:16:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:16:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:16:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:16:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 19:16:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 19:16:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:16:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:16:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:16:57,280 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 19:16:57,370 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:16:57,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:16:57,564 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:16:57,569 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:16:57,569 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 19:16:57,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:57 BoogieIcfgContainer [2023-08-26 19:16:57,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:16:57,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:16:57,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:16:57,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:16:57,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:16:56" (1/3) ... [2023-08-26 19:16:57,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb3db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:57, skipping insertion in model container [2023-08-26 19:16:57,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:57" (2/3) ... [2023-08-26 19:16:57,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb3db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:57, skipping insertion in model container [2023-08-26 19:16:57,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:57" (3/3) ... [2023-08-26 19:16:57,575 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-26 19:16:57,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:16:57,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 19:16:57,588 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:16:57,666 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 19:16:57,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 140 transitions, 312 flow [2023-08-26 19:16:57,746 INFO L124 PetriNetUnfolderBase]: 10/136 cut-off events. [2023-08-26 19:16:57,746 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:16:57,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 136 events. 10/136 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-26 19:16:57,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 140 transitions, 312 flow [2023-08-26 19:16:57,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 123 transitions, 270 flow [2023-08-26 19:16:57,758 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:16:57,770 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 123 transitions, 270 flow [2023-08-26 19:16:57,772 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 123 transitions, 270 flow [2023-08-26 19:16:57,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 270 flow [2023-08-26 19:16:57,805 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-26 19:16:57,806 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:16:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 10/123 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-26 19:16:57,807 INFO L119 LiptonReduction]: Number of co-enabled transitions 1608 [2023-08-26 19:17:01,112 INFO L134 LiptonReduction]: Checked pairs total: 2062 [2023-08-26 19:17:01,112 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 19:17:01,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:17:01,133 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;@683bdb03, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:17:01,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 19:17:01,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:17:01,134 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 19:17:01,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:01,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:17:01,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:01,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 495, now seen corresponding path program 1 times [2023-08-26 19:17:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979730739] [2023-08-26 19:17:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979730739] [2023-08-26 19:17:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979730739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:17:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702632979] [2023-08-26 19:17:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:01,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:17:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:01,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:17:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:17:01,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 256 [2023-08-26 19:17:01,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:01,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 256 [2023-08-26 19:17:01,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:01,351 INFO L124 PetriNetUnfolderBase]: 513/692 cut-off events. [2023-08-26 19:17:01,351 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 19:17:01,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1638 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-08-26 19:17:01,358 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 19:17:01,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-08-26 19:17:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:17:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:17:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-26 19:17:01,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568359375 [2023-08-26 19:17:01,371 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-26 19:17:01,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-26 19:17:01,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:01,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-26 19:17:01,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,381 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,382 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 2 states and 291 transitions. [2023-08-26 19:17:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-08-26 19:17:01,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 19:17:01,386 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-08-26 19:17:01,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-26 19:17:01,389 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:17:01,389 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-08-26 19:17:01,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:17:01,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:17:01,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:01,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 488728, now seen corresponding path program 1 times [2023-08-26 19:17:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918917051] [2023-08-26 19:17:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918917051] [2023-08-26 19:17:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918917051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:01,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:01,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433866238] [2023-08-26 19:17:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:01,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:01,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:01,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:01,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 19:17:01,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:01,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 19:17:01,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:01,762 INFO L124 PetriNetUnfolderBase]: 487/656 cut-off events. [2023-08-26 19:17:01,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:01,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1539 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-08-26 19:17:01,766 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 19:17:01,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-08-26 19:17:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 19:17:01,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2023-08-26 19:17:01,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 19:17:01,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 19:17:01,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:01,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 19:17:01,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,773 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 321 transitions. [2023-08-26 19:17:01,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-08-26 19:17:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:17:01,774 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-26 19:17:01,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-26 19:17:01,776 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:17:01,777 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-26 19:17:01,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:17:01,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:17:01,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:01,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash 488729, now seen corresponding path program 1 times [2023-08-26 19:17:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793370057] [2023-08-26 19:17:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793370057] [2023-08-26 19:17:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793370057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410647706] [2023-08-26 19:17:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:01,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:01,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 19:17:01,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:01,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 19:17:01,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:01,983 INFO L124 PetriNetUnfolderBase]: 461/620 cut-off events. [2023-08-26 19:17:01,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:01,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1429 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-08-26 19:17:01,987 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 19:17:01,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-08-26 19:17:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 19:17:01,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4309895833333333 [2023-08-26 19:17:01,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 19:17:01,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 19:17:01,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:01,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 19:17:01,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,991 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 331 transitions. [2023-08-26 19:17:01,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-08-26 19:17:01,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:01,993 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-08-26 19:17:01,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-26 19:17:01,994 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 19:17:01,994 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-08-26 19:17:01,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:01,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:17:01,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:17:01,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:01,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 469677638, now seen corresponding path program 1 times [2023-08-26 19:17:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316811532] [2023-08-26 19:17:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316811532] [2023-08-26 19:17:02,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316811532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905753622] [2023-08-26 19:17:02,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 19:17:02,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 19:17:02,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,182 INFO L124 PetriNetUnfolderBase]: 445/596 cut-off events. [2023-08-26 19:17:02,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1358 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-08-26 19:17:02,185 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 19:17:02,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-08-26 19:17:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-26 19:17:02,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283854166666667 [2023-08-26 19:17:02,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-26 19:17:02,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-26 19:17:02,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-26 19:17:02,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,189 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 329 transitions. [2023-08-26 19:17:02,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-08-26 19:17:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,191 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-08-26 19:17:02,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-26 19:17:02,193 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 19:17:02,193 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-08-26 19:17:02,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:17:02,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:17:02,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash 469677637, now seen corresponding path program 1 times [2023-08-26 19:17:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524390530] [2023-08-26 19:17:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524390530] [2023-08-26 19:17:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524390530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055585537] [2023-08-26 19:17:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 19:17:02,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 19:17:02,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,308 INFO L124 PetriNetUnfolderBase]: 429/572 cut-off events. [2023-08-26 19:17:02,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1285 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-08-26 19:17:02,310 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 19:17:02,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-08-26 19:17:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-26 19:17:02,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2023-08-26 19:17:02,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-26 19:17:02,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-26 19:17:02,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-26 19:17:02,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,314 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 315 transitions. [2023-08-26 19:17:02,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-08-26 19:17:02,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,315 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-08-26 19:17:02,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 19:17:02,315 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:17:02,315 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-08-26 19:17:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:17:02,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 388656166, now seen corresponding path program 1 times [2023-08-26 19:17:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478105997] [2023-08-26 19:17:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478105997] [2023-08-26 19:17:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478105997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591831560] [2023-08-26 19:17:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 19:17:02,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 19:17:02,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,409 INFO L124 PetriNetUnfolderBase]: 403/536 cut-off events. [2023-08-26 19:17:02,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1185 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-08-26 19:17:02,411 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 19:17:02,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-08-26 19:17:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-26 19:17:02,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231770833333333 [2023-08-26 19:17:02,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-26 19:17:02,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-26 19:17:02,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-26 19:17:02,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,415 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 325 transitions. [2023-08-26 19:17:02,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-08-26 19:17:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,416 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-08-26 19:17:02,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-26 19:17:02,416 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2023-08-26 19:17:02,416 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-08-26 19:17:02,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:17:02,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash 388656165, now seen corresponding path program 1 times [2023-08-26 19:17:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775748195] [2023-08-26 19:17:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775748195] [2023-08-26 19:17:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775748195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539094829] [2023-08-26 19:17:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 19:17:02,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 19:17:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,480 INFO L124 PetriNetUnfolderBase]: 377/500 cut-off events. [2023-08-26 19:17:02,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1077 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-08-26 19:17:02,481 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 19:17:02,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-08-26 19:17:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-26 19:17:02,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049479166666667 [2023-08-26 19:17:02,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-26 19:17:02,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-26 19:17:02,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-26 19:17:02,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,484 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 311 transitions. [2023-08-26 19:17:02,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-08-26 19:17:02,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,485 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-08-26 19:17:02,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-26 19:17:02,486 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:17:02,486 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-08-26 19:17:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:17:02,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -163570123, now seen corresponding path program 1 times [2023-08-26 19:17:02,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364754339] [2023-08-26 19:17:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364754339] [2023-08-26 19:17:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364754339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125937709] [2023-08-26 19:17:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 19:17:02,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 19:17:02,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,621 INFO L124 PetriNetUnfolderBase]: 313/420 cut-off events. [2023-08-26 19:17:02,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 853 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2023-08-26 19:17:02,623 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-26 19:17:02,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-08-26 19:17:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 19:17:02,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2023-08-26 19:17:02,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 19:17:02,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 19:17:02,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 19:17:02,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,626 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 321 transitions. [2023-08-26 19:17:02,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-08-26 19:17:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,627 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-08-26 19:17:02,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-26 19:17:02,627 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:17:02,627 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-08-26 19:17:02,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:17:02,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash -163570124, now seen corresponding path program 1 times [2023-08-26 19:17:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611585137] [2023-08-26 19:17:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611585137] [2023-08-26 19:17:02,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611585137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:17:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281651658] [2023-08-26 19:17:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:17:02,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:17:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:17:02,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 256 [2023-08-26 19:17:02,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 256 [2023-08-26 19:17:02,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,750 INFO L124 PetriNetUnfolderBase]: 249/340 cut-off events. [2023-08-26 19:17:02,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:17:02,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 645 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-08-26 19:17:02,751 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-26 19:17:02,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-08-26 19:17:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-26 19:17:02,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3658854166666667 [2023-08-26 19:17:02,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-26 19:17:02,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-26 19:17:02,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-26 19:17:02,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,754 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 281 transitions. [2023-08-26 19:17:02,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-08-26 19:17:02,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,755 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-08-26 19:17:02,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-26 19:17:02,756 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:17:02,756 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-08-26 19:17:02,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:17:02,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1012705554, now seen corresponding path program 1 times [2023-08-26 19:17:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315513720] [2023-08-26 19:17:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315513720] [2023-08-26 19:17:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315513720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:02,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188253413] [2023-08-26 19:17:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:02,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:02,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 256 [2023-08-26 19:17:02,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:02,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 256 [2023-08-26 19:17:02,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:02,989 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-26 19:17:02,989 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 19:17:02,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1784 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-08-26 19:17:02,991 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-26 19:17:02,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-08-26 19:17:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 19:17:02,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2023-08-26 19:17:02,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 19:17:02,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 19:17:02,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:02,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 19:17:02,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,994 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 357 transitions. [2023-08-26 19:17:02,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-08-26 19:17:02,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:02,996 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-08-26 19:17:02,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 19:17:02,997 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:17:02,997 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-08-26 19:17:02,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:02,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:02,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:17:02,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:02,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1430571298, now seen corresponding path program 1 times [2023-08-26 19:17:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47264297] [2023-08-26 19:17:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47264297] [2023-08-26 19:17:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47264297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:17:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008045682] [2023-08-26 19:17:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:03,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 19:17:03,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:03,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 19:17:03,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:03,296 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-26 19:17:03,296 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-26 19:17:03,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 641 events. 461/641 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1796 event pairs, 37 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 1645. Up to 435 conditions per place. [2023-08-26 19:17:03,298 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-26 19:17:03,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 297 flow [2023-08-26 19:17:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:17:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:17:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 19:17:03,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455078125 [2023-08-26 19:17:03,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 19:17:03,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 19:17:03,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:03,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 19:17:03,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,302 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 4 states and 466 transitions. [2023-08-26 19:17:03,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 297 flow [2023-08-26 19:17:03,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:03,304 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2023-08-26 19:17:03,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 19:17:03,304 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:17:03,304 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2023-08-26 19:17:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:03,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:17:03,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:03,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1017463242, now seen corresponding path program 1 times [2023-08-26 19:17:03,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:03,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062026142] [2023-08-26 19:17:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062026142] [2023-08-26 19:17:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062026142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121996007] [2023-08-26 19:17:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:03,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:03,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:17:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:03,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:17:03,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:03,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121996007] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:03,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:17:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327704182] [2023-08-26 19:17:03,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:03,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:17:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:17:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:17:03,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 19:17:03,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:03,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 19:17:03,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:03,812 INFO L124 PetriNetUnfolderBase]: 893/1233 cut-off events. [2023-08-26 19:17:03,812 INFO L125 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2023-08-26 19:17:03,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 1233 events. 893/1233 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3870 event pairs, 231 based on Foata normal form. 36/1269 useless extension candidates. Maximal degree in co-relation 3384. Up to 523 conditions per place. [2023-08-26 19:17:03,817 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 80 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2023-08-26 19:17:03,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 88 transitions, 469 flow [2023-08-26 19:17:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:17:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:17:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 19:17:03,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48203125 [2023-08-26 19:17:03,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 19:17:03,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 19:17:03,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:03,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 19:17:03,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,821 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 5 states and 617 transitions. [2023-08-26 19:17:03,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 88 transitions, 469 flow [2023-08-26 19:17:03,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 88 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:17:03,823 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 178 flow [2023-08-26 19:17:03,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 19:17:03,824 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 19:17:03,824 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 178 flow [2023-08-26 19:17:03,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:03,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:03,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:03,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:04,029 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,SelfDestructingSolverStorable11 [2023-08-26 19:17:04,029 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:04,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 319116172, now seen corresponding path program 1 times [2023-08-26 19:17:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644985678] [2023-08-26 19:17:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:04,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644985678] [2023-08-26 19:17:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644985678] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427465849] [2023-08-26 19:17:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:04,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:04,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:04,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:04,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:17:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:04,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:17:04,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:04,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427465849] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:04,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:17:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550175848] [2023-08-26 19:17:04,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:04,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:17:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:17:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:17:04,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 19:17:04,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:04,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 19:17:04,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:04,551 INFO L124 PetriNetUnfolderBase]: 1651/2287 cut-off events. [2023-08-26 19:17:04,551 INFO L125 PetriNetUnfolderBase]: For 2975/2975 co-relation queries the response was YES. [2023-08-26 19:17:04,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7299 conditions, 2287 events. 1651/2287 cut-off events. For 2975/2975 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8407 event pairs, 323 based on Foata normal form. 90/2377 useless extension candidates. Maximal degree in co-relation 7290. Up to 974 conditions per place. [2023-08-26 19:17:04,563 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 88 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-08-26 19:17:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 644 flow [2023-08-26 19:17:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:17:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:17:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-26 19:17:04,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47578125 [2023-08-26 19:17:04,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-26 19:17:04,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-26 19:17:04,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:04,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-26 19:17:04,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,567 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,567 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 178 flow. Second operand 5 states and 609 transitions. [2023-08-26 19:17:04,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 644 flow [2023-08-26 19:17:04,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 636 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 19:17:04,572 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 238 flow [2023-08-26 19:17:04,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-26 19:17:04,572 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 19:17:04,573 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 238 flow [2023-08-26 19:17:04,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:04,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:04,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:04,778 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,SelfDestructingSolverStorable12 [2023-08-26 19:17:04,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:04,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1467249868, now seen corresponding path program 1 times [2023-08-26 19:17:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611750177] [2023-08-26 19:17:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611750177] [2023-08-26 19:17:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611750177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:17:04,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614719743] [2023-08-26 19:17:04,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:04,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:04,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:04,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 19:17:04,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:04,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:04,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 19:17:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:05,143 INFO L124 PetriNetUnfolderBase]: 1541/2125 cut-off events. [2023-08-26 19:17:05,143 INFO L125 PetriNetUnfolderBase]: For 4056/4056 co-relation queries the response was YES. [2023-08-26 19:17:05,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 2125 events. 1541/2125 cut-off events. For 4056/4056 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7711 event pairs, 343 based on Foata normal form. 30/2155 useless extension candidates. Maximal degree in co-relation 8093. Up to 1919 conditions per place. [2023-08-26 19:17:05,154 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 54 selfloop transitions, 11 changer transitions 11/76 dead transitions. [2023-08-26 19:17:05,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 517 flow [2023-08-26 19:17:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:17:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:17:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 19:17:05,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455078125 [2023-08-26 19:17:05,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 19:17:05,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 19:17:05,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:05,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 19:17:05,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,158 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 238 flow. Second operand 4 states and 466 transitions. [2023-08-26 19:17:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 517 flow [2023-08-26 19:17:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:17:05,165 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 300 flow [2023-08-26 19:17:05,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 19:17:05,165 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 19:17:05,165 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 300 flow [2023-08-26 19:17:05,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:05,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:05,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:17:05,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:05,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1603559960, now seen corresponding path program 2 times [2023-08-26 19:17:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:05,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155299563] [2023-08-26 19:17:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155299563] [2023-08-26 19:17:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155299563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:17:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927041932] [2023-08-26 19:17:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:05,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 19:17:05,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:05,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 19:17:05,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:05,496 INFO L124 PetriNetUnfolderBase]: 1885/2599 cut-off events. [2023-08-26 19:17:05,496 INFO L125 PetriNetUnfolderBase]: For 5569/5569 co-relation queries the response was YES. [2023-08-26 19:17:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 2599 events. 1885/2599 cut-off events. For 5569/5569 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9687 event pairs, 363 based on Foata normal form. 84/2683 useless extension candidates. Maximal degree in co-relation 10433. Up to 1525 conditions per place. [2023-08-26 19:17:05,511 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 95 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-26 19:17:05,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 788 flow [2023-08-26 19:17:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:17:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:17:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-26 19:17:05,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47578125 [2023-08-26 19:17:05,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-26 19:17:05,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-26 19:17:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:05,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-26 19:17:05,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,516 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,516 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 300 flow. Second operand 5 states and 609 transitions. [2023-08-26 19:17:05,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 788 flow [2023-08-26 19:17:05,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 773 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:05,524 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 340 flow [2023-08-26 19:17:05,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-08-26 19:17:05,525 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-26 19:17:05,525 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 340 flow [2023-08-26 19:17:05,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:05,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:05,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:17:05,525 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:05,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1165396944, now seen corresponding path program 2 times [2023-08-26 19:17:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051719567] [2023-08-26 19:17:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051719567] [2023-08-26 19:17:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051719567] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594052401] [2023-08-26 19:17:05,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:17:05,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:05,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:05,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:17:05,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:17:05,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:05,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:17:05,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:05,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594052401] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:05,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:05,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:17:05,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354307655] [2023-08-26 19:17:05,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:05,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:17:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:17:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:17:05,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 19:17:05,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:05,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:05,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 19:17:05,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:06,222 INFO L124 PetriNetUnfolderBase]: 2379/3273 cut-off events. [2023-08-26 19:17:06,222 INFO L125 PetriNetUnfolderBase]: For 11054/11054 co-relation queries the response was YES. [2023-08-26 19:17:06,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14294 conditions, 3273 events. 2379/3273 cut-off events. For 11054/11054 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12730 event pairs, 673 based on Foata normal form. 84/3357 useless extension candidates. Maximal degree in co-relation 14277. Up to 1925 conditions per place. [2023-08-26 19:17:06,245 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 115 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-08-26 19:17:06,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 1012 flow [2023-08-26 19:17:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:17:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:17:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 19:17:06,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48203125 [2023-08-26 19:17:06,247 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 19:17:06,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 19:17:06,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:06,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 19:17:06,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:06,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:06,250 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:06,250 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 340 flow. Second operand 5 states and 617 transitions. [2023-08-26 19:17:06,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 1012 flow [2023-08-26 19:17:06,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 942 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-26 19:17:06,266 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 369 flow [2023-08-26 19:17:06,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-08-26 19:17:06,267 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-26 19:17:06,267 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 369 flow [2023-08-26 19:17:06,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:06,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:06,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:06,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:06,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:06,473 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:17:06,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1994481652, now seen corresponding path program 1 times [2023-08-26 19:17:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026777813] [2023-08-26 19:17:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:06,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026777813] [2023-08-26 19:17:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026777813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186118386] [2023-08-26 19:17:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:06,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:06,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:06,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:17:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:07,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:17:07,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:18:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:18:26,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:18:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:18:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186118386] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:18:54,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:18:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-08-26 19:18:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814270478] [2023-08-26 19:18:54,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:18:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 19:18:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:18:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 19:18:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=33, NotChecked=0, Total=272 [2023-08-26 19:18:54,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 19:18:54,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 369 flow. Second operand has 17 states, 17 states have (on average 104.6470588235294) internal successors, (1779), 17 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:18:54,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:18:54,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 19:18:54,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:18:58,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:54,684 WARN L234 SmtUtils]: Spent 51.99s on a formula simplification. DAG size of input: 74 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:19:56,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:58,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:01,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:03,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:05,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:07,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:12,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:34,062 WARN L234 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 80 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:21:45,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:46,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:57,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:59,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:01,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:03,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:45,438 WARN L234 SmtUtils]: Spent 25.45s on a formula simplification. DAG size of input: 53 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:22:47,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:49,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:51,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:53,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:55,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:57,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:59,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:01,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:03,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:05,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:07,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:09,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 19:23:11,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:13,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:15,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:28,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:30,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:32,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:35,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:37,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:40,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:42,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:44,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:46,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:48,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:50,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:52,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:55,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:57,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:17,998 WARN L234 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 81 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:24:20,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:22,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:24,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:26,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:28,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:30,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:32,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:34,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:47,491 WARN L234 SmtUtils]: Spent 48.00s on a formula simplification. DAG size of input: 56 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:25:49,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:51,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:53,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:03,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:05,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:07,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:09,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:11,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:12,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:20,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:24,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:27,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:29,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:32,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:34,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:36,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:38,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:39,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:41,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:43,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:45,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:48,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:49,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:51,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:54,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:56,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:58,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:05,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 19:27:07,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:08,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:10,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:13,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:15,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:17,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:19,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:22,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:24,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:27,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:29,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:31,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:33,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:35,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:38,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:40,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:44,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:46,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:48,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:50,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:51,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:53,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:55,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:57,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:59,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:01,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:03,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:05,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:07,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:09,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:11,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:13,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:15,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:17,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:19,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:21,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:25,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:27,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:30,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:32,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:34,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:36,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:38,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:40,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:42,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:47,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:52,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:54,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 19:28:56,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:58,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:59,973 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 19:29:02,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:04,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:06,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:08,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:10,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:25,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:28,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:30,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:32,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:34,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:36,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:38,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:40,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:42,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:43,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:45,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:48,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:49,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:51,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:53,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:56,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:58,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:00,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:02,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:04,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:06,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:08,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:10,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:12,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30: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 19:30:16,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:17,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:19,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:21,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:23,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:26,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:06,113 WARN L234 SmtUtils]: Spent 33.33s on a formula simplification. DAG size of input: 75 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:31:08,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:10,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:12,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:14,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:16,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:18,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:20,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:22,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:24,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:26,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:30,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:32,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:34,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:36,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:38,743 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 [] Received shutdown request... [2023-08-26 19:31:39,604 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:31:39,619 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:31:40,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 19:31:40,171 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 19:31:40,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:31:40,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 19:31:40,371 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). [2023-08-26 19:31:40,372 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-08-26 19:31:40,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2023-08-26 19:31:40,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2023-08-26 19:31:40,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 21 remaining) [2023-08-26 19:31:40,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 21 remaining) [2023-08-26 19:31:40,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 21 remaining) [2023-08-26 19:31:40,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 21 remaining) [2023-08-26 19:31:40,374 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:31:40,376 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:31:40,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:31:40,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:31:40 BasicIcfg [2023-08-26 19:31:40,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:31:40,380 INFO L158 Benchmark]: Toolchain (without parser) took 883423.28ms. Allocated memory was 398.5MB in the beginning and 595.6MB in the end (delta: 197.1MB). Free memory was 375.3MB in the beginning and 289.4MB in the end (delta: 85.9MB). Peak memory consumption was 284.3MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,381 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 398.5MB. Free memory was 374.8MB in the beginning and 374.5MB in the end (delta: 300.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:31:40,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.23ms. Allocated memory is still 398.5MB. Free memory was 375.3MB in the beginning and 364.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.39ms. Allocated memory is still 398.5MB. Free memory was 364.3MB in the beginning and 362.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,381 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 398.5MB. Free memory was 362.8MB in the beginning and 361.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,383 INFO L158 Benchmark]: RCFGBuilder took 363.37ms. Allocated memory is still 398.5MB. Free memory was 361.3MB in the beginning and 344.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,383 INFO L158 Benchmark]: TraceAbstraction took 882807.89ms. Allocated memory was 398.5MB in the beginning and 595.6MB in the end (delta: 197.1MB). Free memory was 343.4MB in the beginning and 289.4MB in the end (delta: 54.0MB). Peak memory consumption was 252.9MB. Max. memory is 16.0GB. [2023-08-26 19:31:40,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 398.5MB. Free memory was 374.8MB in the beginning and 374.5MB in the end (delta: 300.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 184.23ms. Allocated memory is still 398.5MB. Free memory was 375.3MB in the beginning and 364.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.39ms. Allocated memory is still 398.5MB. Free memory was 364.3MB in the beginning and 362.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 398.5MB. Free memory was 362.8MB in the beginning and 361.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 363.37ms. Allocated memory is still 398.5MB. Free memory was 361.3MB in the beginning and 344.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 882807.89ms. Allocated memory was 398.5MB in the beginning and 595.6MB in the end (delta: 197.1MB). Free memory was 343.4MB in the beginning and 289.4MB in the end (delta: 54.0MB). Peak memory consumption was 252.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 126 PlacesBefore, 50 PlacesAfterwards, 123 TransitionsBefore, 41 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 116 TotalNumberOfCompositions, 2062 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2062, independent: 2062, independent conditional: 0, independent unconditional: 2062, 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: 827, independent: 827, independent conditional: 0, independent unconditional: 827, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2062, independent: 1235, independent conditional: 0, independent unconditional: 1235, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 827, unknown conditional: 0, unknown unconditional: 827] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 101/256 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 20164 conditions, 4421 events (3312/4420 cut-off events. For 16214/16214 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18968 event pairs, 523 based on Foata normal form. 12/4539 useless extension candidates. Maximal degree in co-relation 20145. Up to 2859 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 155 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 882.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 767.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 165 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 394.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 392.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1966 IncrementalHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 0 mSDtfsCounter, 1966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 154 SyntacticMatches, 14 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 458.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=16, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 109.6s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 7684 SizeOfPredicates, 19 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 3/18 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