/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 16:10:46,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 16:10:46,400 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 16:10:46,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 16:10:46,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 16:10:46,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 16:10:46,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 16:10:46,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 16:10:46,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 16:10:46,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 16:10:46,441 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 16:10:46,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 16:10:46,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 16:10:46,442 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 16:10:46,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 16:10:46,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 16:10:46,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 16:10:46,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 16:10:46,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 16:10:46,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 16:10:46,443 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 16:10:46,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 16:10:46,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 16:10:46,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:10:46,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 16:10:46,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 16:10:46,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 16:10:46,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 16:10:46,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 16:10:46,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 16:10:46,446 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 16:10:46,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 16:10:46,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 16:10:46,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 16:10:46,769 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 16:10:46,769 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 16:10:46,770 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 16:10:47,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 16:10:48,177 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 16:10:48,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-26 16:10:48,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4279f6e2/c25de7ab9d574cd1a50bb7691644b55d/FLAGd07f26122 [2023-08-26 16:10:48,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4279f6e2/c25de7ab9d574cd1a50bb7691644b55d [2023-08-26 16:10:48,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 16:10:48,212 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 16:10:48,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 16:10:48,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 16:10:48,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 16:10:48,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dd83ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48, skipping insertion in model container [2023-08-26 16:10:48,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 16:10:48,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:48,440 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 16:10:48,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:48,490 INFO L206 MainTranslator]: Completed translation [2023-08-26 16:10:48,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48 WrapperNode [2023-08-26 16:10:48,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 16:10:48,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:48,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 16:10:48,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 16:10:48,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,536 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 16:10:48,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:48,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 16:10:48,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 16:10:48,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 16:10:48,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 16:10:48,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 16:10:48,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 16:10:48,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 16:10:48,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (1/1) ... [2023-08-26 16:10:48,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:10:48,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:48,614 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 16:10:48,638 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 16:10:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 16:10:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 16:10:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 16:10:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 16:10:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 16:10:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 16:10:48,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 16:10:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 16:10:48,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 16:10:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 16:10:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 16:10:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 16:10:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 16:10:48,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 16:10:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 16:10:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 16:10:48,655 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 16:10:48,763 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 16:10:48,765 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 16:10:49,033 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 16:10:49,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 16:10:49,040 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 16:10:49,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:49 BoogieIcfgContainer [2023-08-26 16:10:49,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 16:10:49,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 16:10:49,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 16:10:49,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 16:10:49,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:10:48" (1/3) ... [2023-08-26 16:10:49,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bee3b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:49, skipping insertion in model container [2023-08-26 16:10:49,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:48" (2/3) ... [2023-08-26 16:10:49,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bee3b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:49, skipping insertion in model container [2023-08-26 16:10:49,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:49" (3/3) ... [2023-08-26 16:10:49,049 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-26 16:10:49,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 16:10:49,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 16:10:49,065 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 16:10:49,127 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 16:10:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 140 transitions, 312 flow [2023-08-26 16:10:49,210 INFO L124 PetriNetUnfolderBase]: 10/136 cut-off events. [2023-08-26 16:10:49,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 16:10:49,215 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 16:10:49,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 140 transitions, 312 flow [2023-08-26 16:10:49,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 123 transitions, 270 flow [2023-08-26 16:10:49,223 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 16:10:49,231 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 123 transitions, 270 flow [2023-08-26 16:10:49,233 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 123 transitions, 270 flow [2023-08-26 16:10:49,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 270 flow [2023-08-26 16:10:49,309 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-26 16:10:49,309 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 16:10:49,310 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 16:10:49,312 INFO L119 LiptonReduction]: Number of co-enabled transitions 1608 [2023-08-26 16:10:53,384 INFO L134 LiptonReduction]: Checked pairs total: 2062 [2023-08-26 16:10:53,385 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 16:10:53,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 16:10:53,416 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;@3a6a19b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 16:10:53,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 16:10:53,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 16:10:53,417 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 16:10:53,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:53,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:53,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 16:10:53,418 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 16:10:53,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash 495, now seen corresponding path program 1 times [2023-08-26 16:10:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627174461] [2023-08-26 16:10:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:53,514 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 16:10:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627174461] [2023-08-26 16:10:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627174461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 16:10:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944231439] [2023-08-26 16:10:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:53,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 16:10:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 16:10:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 16:10:53,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 256 [2023-08-26 16:10:53,547 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 16:10:53,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:53,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 256 [2023-08-26 16:10:53,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:53,665 INFO L124 PetriNetUnfolderBase]: 513/692 cut-off events. [2023-08-26 16:10:53,665 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 16:10:53,667 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 16:10:53,671 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 16:10:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-08-26 16:10:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 16:10:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 16:10:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-26 16:10:53,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568359375 [2023-08-26 16:10:53,683 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-26 16:10:53,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-26 16:10:53,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:53,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-26 16:10:53,689 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 16:10:53,693 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 16:10:53,694 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 16:10:53,695 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 2 states and 291 transitions. [2023-08-26 16:10:53,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-08-26 16:10:53,698 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 16:10:53,700 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-08-26 16:10:53,701 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 16:10:53,704 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 16:10:53,704 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-08-26 16:10:53,705 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 16:10:53,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:53,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 16:10:53,705 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 16:10:53,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 488728, now seen corresponding path program 1 times [2023-08-26 16:10:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507646412] [2023-08-26 16:10:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,115 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 16:10:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507646412] [2023-08-26 16:10:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507646412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278212144] [2023-08-26 16:10:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 16:10:54,122 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 16:10:54,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 16:10:54,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:54,215 INFO L124 PetriNetUnfolderBase]: 487/656 cut-off events. [2023-08-26 16:10:54,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:54,216 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 16:10:54,219 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 16:10:54,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-08-26 16:10:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 16:10:54,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2023-08-26 16:10:54,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 16:10:54,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 16:10:54,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:54,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 16:10:54,223 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 16:10:54,225 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 16:10:54,226 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 16:10:54,226 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 321 transitions. [2023-08-26 16:10:54,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-08-26 16:10:54,227 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 16:10:54,227 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-26 16:10:54,228 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 16:10:54,228 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 16:10:54,228 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-26 16:10:54,229 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 16:10:54,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:54,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 16:10:54,229 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 16:10:54,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 488729, now seen corresponding path program 1 times [2023-08-26 16:10:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787335733] [2023-08-26 16:10:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,330 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 16:10:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787335733] [2023-08-26 16:10:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787335733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15586555] [2023-08-26 16:10:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 16:10:54,334 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 16:10:54,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 16:10:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:54,408 INFO L124 PetriNetUnfolderBase]: 461/620 cut-off events. [2023-08-26 16:10:54,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:54,409 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 16:10:54,412 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 16:10:54,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-08-26 16:10:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 16:10:54,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4309895833333333 [2023-08-26 16:10:54,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 16:10:54,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 16:10:54,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:54,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 16:10:54,415 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 16:10:54,417 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 16:10:54,418 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 16:10:54,418 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 331 transitions. [2023-08-26 16:10:54,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-08-26 16:10:54,418 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 16:10:54,419 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-08-26 16:10:54,419 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 16:10:54,420 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 16:10:54,420 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-08-26 16:10:54,420 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 16:10:54,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:54,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:54,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 16:10:54,421 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 16:10:54,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 469677638, now seen corresponding path program 1 times [2023-08-26 16:10:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332032266] [2023-08-26 16:10:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,541 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 16:10:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332032266] [2023-08-26 16:10:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332032266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754257842] [2023-08-26 16:10:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 16:10:54,548 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 16:10:54,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 16:10:54,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:54,619 INFO L124 PetriNetUnfolderBase]: 445/596 cut-off events. [2023-08-26 16:10:54,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:54,620 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 16:10:54,623 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 16:10:54,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-08-26 16:10:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-26 16:10:54,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283854166666667 [2023-08-26 16:10:54,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-26 16:10:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-26 16:10:54,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:54,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-26 16:10:54,626 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 16:10:54,628 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 16:10:54,628 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 16:10:54,628 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 329 transitions. [2023-08-26 16:10:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-08-26 16:10:54,629 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 16:10:54,630 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-08-26 16:10:54,630 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 16:10:54,631 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 16:10:54,631 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-08-26 16:10:54,631 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 16:10:54,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:54,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 16:10:54,632 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 16:10:54,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 469677637, now seen corresponding path program 1 times [2023-08-26 16:10:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874325535] [2023-08-26 16:10:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,675 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 16:10:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874325535] [2023-08-26 16:10:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874325535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213772679] [2023-08-26 16:10:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 16:10:54,678 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 16:10:54,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 16:10:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:54,749 INFO L124 PetriNetUnfolderBase]: 429/572 cut-off events. [2023-08-26 16:10:54,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:54,750 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 16:10:54,753 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 16:10:54,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-08-26 16:10:54,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-26 16:10:54,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2023-08-26 16:10:54,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-26 16:10:54,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-26 16:10:54,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:54,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-26 16:10:54,756 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 16:10:54,757 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 16:10:54,758 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 16:10:54,758 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 315 transitions. [2023-08-26 16:10:54,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-08-26 16:10:54,758 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 16:10:54,759 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-08-26 16:10:54,759 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 16:10:54,760 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 16:10:54,760 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-08-26 16:10:54,760 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 16:10:54,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:54,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 16:10:54,761 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 16:10:54,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 388656166, now seen corresponding path program 1 times [2023-08-26 16:10:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389401403] [2023-08-26 16:10:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,853 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 16:10:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389401403] [2023-08-26 16:10:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389401403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299658417] [2023-08-26 16:10:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 16:10:54,857 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 16:10:54,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 16:10:54,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:54,921 INFO L124 PetriNetUnfolderBase]: 403/536 cut-off events. [2023-08-26 16:10:54,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:54,922 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 16:10:54,924 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 16:10:54,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-08-26 16:10:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-26 16:10:54,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231770833333333 [2023-08-26 16:10:54,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-26 16:10:54,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-26 16:10:54,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:54,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-26 16:10:54,928 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 16:10:54,929 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 16:10:54,930 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 16:10:54,930 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 325 transitions. [2023-08-26 16:10:54,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-08-26 16:10:54,931 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 16:10:54,932 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-08-26 16:10:54,932 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 16:10:54,934 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2023-08-26 16:10:54,936 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-08-26 16:10:54,937 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 16:10:54,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:54,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 16:10:54,938 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 16:10:54,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 388656165, now seen corresponding path program 1 times [2023-08-26 16:10:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:54,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147104365] [2023-08-26 16:10:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:54,980 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 16:10:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147104365] [2023-08-26 16:10:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147104365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732518495] [2023-08-26 16:10:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:54,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:54,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 256 [2023-08-26 16:10:54,984 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 16:10:54,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:54,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 256 [2023-08-26 16:10:54,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:55,068 INFO L124 PetriNetUnfolderBase]: 377/500 cut-off events. [2023-08-26 16:10:55,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:55,070 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 16:10:55,072 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 16:10:55,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-08-26 16:10:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-26 16:10:55,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049479166666667 [2023-08-26 16:10:55,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-26 16:10:55,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-26 16:10:55,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:55,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-26 16:10:55,075 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 16:10:55,076 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 16:10:55,076 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 16:10:55,076 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 311 transitions. [2023-08-26 16:10:55,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-08-26 16:10:55,079 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 16:10:55,080 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-08-26 16:10:55,080 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 16:10:55,081 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 16:10:55,081 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-08-26 16:10:55,081 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 16:10:55,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:55,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:55,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 16:10:55,084 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 16:10:55,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -163570123, now seen corresponding path program 1 times [2023-08-26 16:10:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863990921] [2023-08-26 16:10:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:55,308 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 16:10:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863990921] [2023-08-26 16:10:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863990921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513713083] [2023-08-26 16:10:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:55,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:55,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-26 16:10:55,311 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 16:10:55,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:55,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-26 16:10:55,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:55,381 INFO L124 PetriNetUnfolderBase]: 313/420 cut-off events. [2023-08-26 16:10:55,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:55,382 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 16:10:55,384 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-26 16:10:55,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-08-26 16:10:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 16:10:55,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2023-08-26 16:10:55,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 16:10:55,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 16:10:55,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:55,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 16:10:55,387 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 16:10:55,388 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 16:10:55,388 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 16:10:55,388 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 321 transitions. [2023-08-26 16:10:55,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-08-26 16:10:55,389 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 16:10:55,390 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-08-26 16:10:55,390 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 16:10:55,392 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 16:10:55,392 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-08-26 16:10:55,393 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 16:10:55,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:55,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:55,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 16:10:55,393 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 16:10:55,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -163570124, now seen corresponding path program 1 times [2023-08-26 16:10:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975236707] [2023-08-26 16:10:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:55,561 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 16:10:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975236707] [2023-08-26 16:10:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975236707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:55,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:55,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 16:10:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117202385] [2023-08-26 16:10:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:55,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:55,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 256 [2023-08-26 16:10:55,568 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 16:10:55,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:55,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 256 [2023-08-26 16:10:55,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:55,619 INFO L124 PetriNetUnfolderBase]: 249/340 cut-off events. [2023-08-26 16:10:55,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:55,620 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 16:10:55,622 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-26 16:10:55,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-08-26 16:10:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-26 16:10:55,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3658854166666667 [2023-08-26 16:10:55,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-26 16:10:55,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-26 16:10:55,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:55,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-26 16:10:55,624 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 16:10:55,625 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 16:10:55,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 16:10:55,626 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 281 transitions. [2023-08-26 16:10:55,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-08-26 16:10:55,626 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 16:10:55,627 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-08-26 16:10:55,627 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 16:10:55,627 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 16:10:55,628 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-08-26 16:10:55,628 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 16:10:55,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:55,628 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 16:10:55,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 16:10:55,628 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 16:10:55,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1012705554, now seen corresponding path program 1 times [2023-08-26 16:10:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217263704] [2023-08-26 16:10:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:55,832 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 16:10:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217263704] [2023-08-26 16:10:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217263704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803702611] [2023-08-26 16:10:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:55,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:55,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 256 [2023-08-26 16:10:55,837 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 16:10:55,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:55,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 256 [2023-08-26 16:10:55,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:55,938 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-26 16:10:55,938 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 16:10:55,939 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 16:10:55,942 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-26 16:10:55,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-08-26 16:10:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 16:10:55,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2023-08-26 16:10:55,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 16:10:55,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 16:10:55,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:55,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 16:10:55,945 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 16:10:55,946 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 16:10:55,946 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 16:10:55,946 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 357 transitions. [2023-08-26 16:10:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-08-26 16:10:55,948 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 16:10:55,949 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-08-26 16:10:55,950 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 16:10:55,950 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 16:10:55,950 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-08-26 16:10:55,951 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 16:10:55,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:55,951 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 16:10:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 16:10:55,951 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 16:10:55,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1430571298, now seen corresponding path program 1 times [2023-08-26 16:10:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453676136] [2023-08-26 16:10:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:56,243 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 16:10:56,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453676136] [2023-08-26 16:10:56,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453676136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:56,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:56,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217869400] [2023-08-26 16:10:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:56,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:56,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:10:56,247 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 16:10:56,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:56,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:10:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:56,427 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-26 16:10:56,428 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-26 16:10:56,429 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 16:10:56,431 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-26 16:10:56,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 297 flow [2023-08-26 16:10:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 16:10:56,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455078125 [2023-08-26 16:10:56,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 16:10:56,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 16:10:56,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:56,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 16:10:56,436 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 16:10:56,437 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 16:10:56,438 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 16:10:56,438 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 4 states and 466 transitions. [2023-08-26 16:10:56,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 297 flow [2023-08-26 16:10:56,439 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 16:10:56,440 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2023-08-26 16:10:56,440 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 16:10:56,441 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 16:10:56,441 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2023-08-26 16:10:56,441 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 16:10:56,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:56,441 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 16:10:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 16:10:56,442 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 16:10:56,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1017463242, now seen corresponding path program 1 times [2023-08-26 16:10:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425738427] [2023-08-26 16:10:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:56,608 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 16:10:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425738427] [2023-08-26 16:10:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425738427] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:10:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929483757] [2023-08-26 16:10:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:56,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:56,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:56,613 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 16:10:56,656 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 16:10:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:56,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:10:56,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:10:56,866 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 16:10:56,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:10:56,931 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 16:10:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929483757] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:10:56,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:10:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:10:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504129897] [2023-08-26 16:10:56,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:10:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:56,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 16:10:56,935 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 16:10:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 16:10:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:57,185 INFO L124 PetriNetUnfolderBase]: 893/1233 cut-off events. [2023-08-26 16:10:57,185 INFO L125 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2023-08-26 16:10:57,188 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 16:10:57,193 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 80 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2023-08-26 16:10:57,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 88 transitions, 469 flow [2023-08-26 16:10:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:10:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:10:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 16:10:57,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48203125 [2023-08-26 16:10:57,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 16:10:57,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 16:10:57,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:57,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 16:10:57,198 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 16:10:57,199 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 16:10:57,200 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 16:10:57,200 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 5 states and 617 transitions. [2023-08-26 16:10:57,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 88 transitions, 469 flow [2023-08-26 16:10:57,202 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 16:10:57,203 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 178 flow [2023-08-26 16:10:57,204 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 16:10:57,204 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 16:10:57,204 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 178 flow [2023-08-26 16:10:57,205 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 16:10:57,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:57,205 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 16:10:57,217 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 16:10:57,411 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 16:10:57,411 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 16:10:57,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 319116172, now seen corresponding path program 1 times [2023-08-26 16:10:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014131101] [2023-08-26 16:10:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:57,563 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 16:10:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014131101] [2023-08-26 16:10:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014131101] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:10:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204958948] [2023-08-26 16:10:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:57,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:57,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:57,565 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 16:10:57,568 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 16:10:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:57,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:10:57,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:10:57,754 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 16:10:57,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:10:57,814 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 16:10:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204958948] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:10:57,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:10:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:10:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443650801] [2023-08-26 16:10:57,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:10:57,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:57,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:57,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:57,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 16:10:57,817 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 16:10:57,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:57,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 16:10:57,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:58,126 INFO L124 PetriNetUnfolderBase]: 1651/2287 cut-off events. [2023-08-26 16:10:58,126 INFO L125 PetriNetUnfolderBase]: For 2975/2975 co-relation queries the response was YES. [2023-08-26 16:10:58,131 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 16:10:58,142 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 88 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-08-26 16:10:58,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 644 flow [2023-08-26 16:10:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:10:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:10:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-26 16:10:58,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47578125 [2023-08-26 16:10:58,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-26 16:10:58,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-26 16:10:58,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:58,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-26 16:10:58,146 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 16:10:58,148 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 16:10:58,148 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 16:10:58,148 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 178 flow. Second operand 5 states and 609 transitions. [2023-08-26 16:10:58,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 644 flow [2023-08-26 16:10:58,153 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 16:10:58,155 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 238 flow [2023-08-26 16:10:58,155 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 16:10:58,155 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 16:10:58,156 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 238 flow [2023-08-26 16:10:58,156 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 16:10:58,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:58,156 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 16:10:58,164 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 16:10:58,362 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 16:10:58,362 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 16:10:58,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1467249868, now seen corresponding path program 1 times [2023-08-26 16:10:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769662002] [2023-08-26 16:10:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:58,550 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 16:10:58,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769662002] [2023-08-26 16:10:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769662002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528625498] [2023-08-26 16:10:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:58,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:58,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:10:58,553 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 16:10:58,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:58,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:10:58,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:58,820 INFO L124 PetriNetUnfolderBase]: 1541/2125 cut-off events. [2023-08-26 16:10:58,820 INFO L125 PetriNetUnfolderBase]: For 4056/4056 co-relation queries the response was YES. [2023-08-26 16:10:58,826 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 16:10:58,837 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 54 selfloop transitions, 11 changer transitions 11/76 dead transitions. [2023-08-26 16:10:58,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 517 flow [2023-08-26 16:10:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 16:10:58,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455078125 [2023-08-26 16:10:58,839 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 16:10:58,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 16:10:58,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:58,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 16:10:58,841 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 16:10:58,842 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 16:10:58,842 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 16:10:58,842 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 238 flow. Second operand 4 states and 466 transitions. [2023-08-26 16:10:58,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 517 flow [2023-08-26 16:10:58,851 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 16:10:58,852 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 300 flow [2023-08-26 16:10:58,852 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 16:10:58,853 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 16:10:58,853 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 300 flow [2023-08-26 16:10:58,853 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 16:10:58,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:58,853 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 16:10:58,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 16:10:58,854 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 16:10:58,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1603559960, now seen corresponding path program 2 times [2023-08-26 16:10:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341754800] [2023-08-26 16:10:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:58,967 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 16:10:58,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341754800] [2023-08-26 16:10:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341754800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:58,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079877573] [2023-08-26 16:10:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:58,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:58,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:58,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:58,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 16:10:58,969 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 16:10:58,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:58,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 16:10:58,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:59,291 INFO L124 PetriNetUnfolderBase]: 1885/2599 cut-off events. [2023-08-26 16:10:59,293 INFO L125 PetriNetUnfolderBase]: For 5569/5569 co-relation queries the response was YES. [2023-08-26 16:10:59,300 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 16:10:59,317 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 95 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-26 16:10:59,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 788 flow [2023-08-26 16:10:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:10:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:10:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-26 16:10:59,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47578125 [2023-08-26 16:10:59,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-26 16:10:59,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-26 16:10:59,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:59,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-26 16:10:59,321 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 16:10:59,323 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 16:10:59,324 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 16:10:59,324 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 300 flow. Second operand 5 states and 609 transitions. [2023-08-26 16:10:59,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 788 flow [2023-08-26 16:10:59,342 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 16:10:59,344 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 340 flow [2023-08-26 16:10:59,344 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 16:10:59,344 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-26 16:10:59,344 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 340 flow [2023-08-26 16:10:59,345 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 16:10:59,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:59,345 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 16:10:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 16:10:59,345 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 16:10:59,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1165396944, now seen corresponding path program 2 times [2023-08-26 16:10:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511713011] [2023-08-26 16:10:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:59,445 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 16:10:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511713011] [2023-08-26 16:10:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511713011] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:10:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700829016] [2023-08-26 16:10:59,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 16:10:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:59,449 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 16:10:59,457 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 16:10:59,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 16:10:59,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:10:59,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:10:59,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:10:59,653 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 16:10:59,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:10:59,693 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 16:10:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700829016] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:10:59,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:10:59,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:10:59,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472053326] [2023-08-26 16:10:59,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:10:59,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:59,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-26 16:10:59,697 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 16:10:59,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:59,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-26 16:10:59,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:11:00,157 INFO L124 PetriNetUnfolderBase]: 2379/3273 cut-off events. [2023-08-26 16:11:00,157 INFO L125 PetriNetUnfolderBase]: For 11054/11054 co-relation queries the response was YES. [2023-08-26 16:11:00,166 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 16:11:00,188 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 115 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-08-26 16:11:00,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 1012 flow [2023-08-26 16:11:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:11:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:11:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 16:11:00,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48203125 [2023-08-26 16:11:00,191 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 16:11:00,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 16:11:00,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:11:00,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 16:11:00,193 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 16:11:00,196 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 16:11:00,196 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 16:11:00,196 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 340 flow. Second operand 5 states and 617 transitions. [2023-08-26 16:11:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 1012 flow [2023-08-26 16:11:00,214 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 16:11:00,216 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 369 flow [2023-08-26 16:11:00,217 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 16:11:00,217 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-26 16:11:00,218 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 369 flow [2023-08-26 16:11:00,218 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 16:11:00,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:11:00,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:11:00,225 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 16:11:00,424 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 16:11:00,424 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 16:11:00,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:11:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1994481652, now seen corresponding path program 1 times [2023-08-26 16:11:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:11:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118186092] [2023-08-26 16:11:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:11:00,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:11:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:11:00,922 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 16:11:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:11:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118186092] [2023-08-26 16:11:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118186092] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:11:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874339740] [2023-08-26 16:11:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:11:00,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:11:00,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:11:00,925 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 16:11:00,927 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 16:11:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:11:01,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:11:01,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:12:11,739 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 16:12:11,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:12:31,312 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 16:12:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874339740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:12:31,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:12:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 16:12:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302742575] [2023-08-26 16:12:31,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:12:31,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 16:12:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:12:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 16:12:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=166, Unknown=23, NotChecked=0, Total=240 [2023-08-26 16:12:31,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:12:31,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 369 flow. Second operand has 16 states, 16 states have (on average 104.875) internal successors, (1678), 16 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:12:31,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:12:31,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:12:31,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:13:04,372 WARN L234 SmtUtils]: Spent 31.52s on a formula simplification. DAG size of input: 74 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:13:07,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:09,318 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 16:13:11,350 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 16:13:13,353 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 16:13:17,237 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 16:13:19,244 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 16:13:21,253 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 16:13:36,089 WARN L234 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 62 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:13:42,950 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 16:13:43,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:45,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:48,304 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 16:13:51,952 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 16:13:52,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:55,019 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 16:13:57,036 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 16:13:59,041 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 16:14:01,056 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 16:14:03,082 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 16:14:06,319 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 16:14:08,324 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 16:14:10,336 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 16:14:12,346 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 16:14:14,361 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 16:14:16,366 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 16:14:18,374 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse2 (* (div c_~x4~0 4294967296) 4294967296)) (.cse1 (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0)) (.cse3 (mod c_~n~0 4294967296)) (.cse4 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 2)) 4294967296))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (< .cse1 (+ c_~x3~0 .cse2 1)) (<= .cse3 (mod c_~x3~0 4294967296)) (or (<= (+ 3 (* 4294967296 (div c_~n~0 4294967296)) c_~x4~0) (+ c_~n~0 .cse2)) (<= (+ c_~x3~0 .cse2) .cse1)) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (< .cse4 .cse3) (= .cse4 (mod (* (div (* (- 1) c_~x4~0) 2) 4294967295) 4294967296)) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0))) is different from false [2023-08-26 16:14:36,817 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 16:14:43,092 INFO L124 PetriNetUnfolderBase]: 3451/4727 cut-off events. [2023-08-26 16:14:43,092 INFO L125 PetriNetUnfolderBase]: For 17163/17163 co-relation queries the response was YES. [2023-08-26 16:14:43,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21261 conditions, 4727 events. 3451/4727 cut-off events. For 17163/17163 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19760 event pairs, 649 based on Foata normal form. 2/4729 useless extension candidates. Maximal degree in co-relation 21242. Up to 3365 conditions per place. [2023-08-26 16:14:43,120 INFO L140 encePairwiseOnDemand]: 239/256 looper letters, 157 selfloop transitions, 69 changer transitions 11/237 dead transitions. [2023-08-26 16:14:43,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 237 transitions, 1853 flow [2023-08-26 16:14:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 16:14:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 16:14:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1617 transitions. [2023-08-26 16:14:43,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.451171875 [2023-08-26 16:14:43,127 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1617 transitions. [2023-08-26 16:14:43,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1617 transitions. [2023-08-26 16:14:43,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:14:43,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1617 transitions. [2023-08-26 16:14:43,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.5) internal successors, (1617), 14 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:14:43,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 256.0) internal successors, (3840), 15 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:14:43,137 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 256.0) internal successors, (3840), 15 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:14:43,137 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 369 flow. Second operand 14 states and 1617 transitions. [2023-08-26 16:14:43,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 237 transitions, 1853 flow [2023-08-26 16:14:43,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 237 transitions, 1771 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 16:14:43,165 INFO L231 Difference]: Finished difference. Result has 85 places, 116 transitions, 1047 flow [2023-08-26 16:14:43,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1047, PETRI_PLACES=85, PETRI_TRANSITIONS=116} [2023-08-26 16:14:43,166 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-26 16:14:43,166 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 116 transitions, 1047 flow [2023-08-26 16:14:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 104.875) internal successors, (1678), 16 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:14:43,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:14:43,167 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 16:14:43,175 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 16:14:43,375 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 16:14:43,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 16:14:43,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:14:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1817984636, now seen corresponding path program 2 times [2023-08-26 16:14:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:14:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903562348] [2023-08-26 16:14:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:14:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:14:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:14:43,901 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 16:14:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:14:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903562348] [2023-08-26 16:14:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903562348] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:14:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710288368] [2023-08-26 16:14:43,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 16:14:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:14:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:14:43,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:14:43,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 16:14:44,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 16:14:44,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:14:44,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-26 16:14:44,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:14:52,636 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 16:14:52,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:15:02,778 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 16:15:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710288368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:15:02,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:15:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 16:15:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813526170] [2023-08-26 16:15:02,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:15:02,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 16:15:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:15:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 16:15:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=161, Unknown=5, NotChecked=0, Total=240 [2023-08-26 16:15:02,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:15:02,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 116 transitions, 1047 flow. Second operand has 16 states, 16 states have (on average 105.1875) internal successors, (1683), 16 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:15:02,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:15:02,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:15:02,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:15:05,040 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 16:15:14,765 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 16:15:16,782 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 16:15:28,262 WARN L234 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:15:30,301 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 16:15:32,474 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 16:15:35,399 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 16:15:37,423 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 16:15:39,545 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 16:15:41,575 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 16:15:43,682 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 16:15:45,741 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 16:15:47,780 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 16:15:49,801 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 16:15:52,062 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 16:15:54,070 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 16:16:03,238 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 16:16:05,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:16:06,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:30,548 WARN L234 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 71 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:17:32,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:34,568 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 16:17:36,576 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 16:17:38,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 16:17:40,589 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 16:17:42,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:46,668 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 16:17:48,675 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 16:17:50,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:52,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 16:17:54,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 16:17:56,273 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 16:17:58,356 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 16:17:59,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:03,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:05,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 16:18:07,339 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 16:18:10,007 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 16:18:12,011 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 16:18:14,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:16,020 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 16:18:18,030 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 16:18:20,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:22,042 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 16:18:24,047 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 16:18:26,061 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 16:18:28,072 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 16:18:30,079 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 16:18:32,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 16:18:34,687 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 16:18:36,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 16:18:38,823 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 16:18:54,287 WARN L234 SmtUtils]: Spent 9.78s on a formula simplification. DAG size of input: 49 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:18:56,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:58,023 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 16:18:59,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:01,214 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 16:19:04,127 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 16:19:06,418 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 16:19:15,807 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 16:19:17,826 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 16:19:18,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:21,090 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 16:19:23,099 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 16:19:25,103 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 16:19:29,606 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 16:19:31,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:34,003 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 16:19:36,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:38,344 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 16:19:41,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:43,749 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 16:19:46,911 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 16:19:48,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:51,134 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 16:19:53,174 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 16:19:55,421 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 16:19:57,442 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 16:19:59,730 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 16:20:01,763 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 16:20:04,146 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 16:20:04,355 INFO L124 PetriNetUnfolderBase]: 4907/6895 cut-off events. [2023-08-26 16:20:04,355 INFO L125 PetriNetUnfolderBase]: For 32272/32272 co-relation queries the response was YES. [2023-08-26 16:20:04,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36558 conditions, 6895 events. 4907/6895 cut-off events. For 32272/32272 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32833 event pairs, 213 based on Foata normal form. 44/6939 useless extension candidates. Maximal degree in co-relation 36531. Up to 3553 conditions per place. [2023-08-26 16:20:04,404 INFO L140 encePairwiseOnDemand]: 245/256 looper letters, 205 selfloop transitions, 158 changer transitions 31/394 dead transitions. [2023-08-26 16:20:04,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 394 transitions, 3839 flow [2023-08-26 16:20:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 16:20:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 16:20:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1970 transitions. [2023-08-26 16:20:04,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45266544117647056 [2023-08-26 16:20:04,410 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1970 transitions. [2023-08-26 16:20:04,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1970 transitions. [2023-08-26 16:20:04,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:20:04,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1970 transitions. [2023-08-26 16:20:04,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 115.88235294117646) internal successors, (1970), 17 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:04,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 256.0) internal successors, (4608), 18 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:04,422 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 256.0) internal successors, (4608), 18 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:04,422 INFO L175 Difference]: Start difference. First operand has 85 places, 116 transitions, 1047 flow. Second operand 17 states and 1970 transitions. [2023-08-26 16:20:04,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 394 transitions, 3839 flow [2023-08-26 16:20:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 394 transitions, 3597 flow, removed 121 selfloop flow, removed 0 redundant places. [2023-08-26 16:20:04,543 INFO L231 Difference]: Finished difference. Result has 111 places, 214 transitions, 2315 flow [2023-08-26 16:20:04,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2315, PETRI_PLACES=111, PETRI_TRANSITIONS=214} [2023-08-26 16:20:04,544 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2023-08-26 16:20:04,544 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 214 transitions, 2315 flow [2023-08-26 16:20:04,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 105.1875) internal successors, (1683), 16 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:04,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:20:04,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:20:04,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 16:20:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 16:20:04,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 16:20:04,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:20:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -478248146, now seen corresponding path program 3 times [2023-08-26 16:20:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:20:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654362426] [2023-08-26 16:20:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:20:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:20:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:20:05,174 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 16:20:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:20:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654362426] [2023-08-26 16:20:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654362426] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:20:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656533944] [2023-08-26 16:20:05,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 16:20:05,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:20:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:20:05,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:20:05,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 16:20:05,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 16:20:05,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:20:05,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:20:05,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:20:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:20:13,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:20:14,089 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 16:20:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656533944] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:20:14,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:20:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 16:20:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939826407] [2023-08-26 16:20:14,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:20:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 16:20:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:20:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 16:20:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-08-26 16:20:14,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:20:14,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 214 transitions, 2315 flow. Second operand has 16 states, 16 states have (on average 105.1875) internal successors, (1683), 16 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:14,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:20:14,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:20:14,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:20:16,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:18,286 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 16:20:20,332 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 16:20:24,331 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 16:20:26,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:28,426 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 16:20:31,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 16:20:33,049 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 16:20:35,553 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 16:20:40,082 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 16:20:44,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:46,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:46,994 INFO L124 PetriNetUnfolderBase]: 6727/9411 cut-off events. [2023-08-26 16:20:46,994 INFO L125 PetriNetUnfolderBase]: For 66743/66743 co-relation queries the response was YES. [2023-08-26 16:20:47,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57525 conditions, 9411 events. 6727/9411 cut-off events. For 66743/66743 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 46709 event pairs, 789 based on Foata normal form. 32/9443 useless extension candidates. Maximal degree in co-relation 57487. Up to 6875 conditions per place. [2023-08-26 16:20:47,057 INFO L140 encePairwiseOnDemand]: 248/256 looper letters, 276 selfloop transitions, 165 changer transitions 13/454 dead transitions. [2023-08-26 16:20:47,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 454 transitions, 5326 flow [2023-08-26 16:20:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 16:20:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 16:20:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1618 transitions. [2023-08-26 16:20:47,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45145089285714285 [2023-08-26 16:20:47,062 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1618 transitions. [2023-08-26 16:20:47,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1618 transitions. [2023-08-26 16:20:47,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:20:47,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1618 transitions. [2023-08-26 16:20:47,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.57142857142857) internal successors, (1618), 14 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:47,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 256.0) internal successors, (3840), 15 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:47,070 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 256.0) internal successors, (3840), 15 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:47,070 INFO L175 Difference]: Start difference. First operand has 111 places, 214 transitions, 2315 flow. Second operand 14 states and 1618 transitions. [2023-08-26 16:20:47,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 454 transitions, 5326 flow [2023-08-26 16:20:47,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 454 transitions, 5137 flow, removed 78 selfloop flow, removed 5 redundant places. [2023-08-26 16:20:47,448 INFO L231 Difference]: Finished difference. Result has 127 places, 320 transitions, 3918 flow [2023-08-26 16:20:47,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3918, PETRI_PLACES=127, PETRI_TRANSITIONS=320} [2023-08-26 16:20:47,449 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 77 predicate places. [2023-08-26 16:20:47,449 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 320 transitions, 3918 flow [2023-08-26 16:20:47,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 105.1875) internal successors, (1683), 16 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:20:47,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:20:47,450 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 16:20:47,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 16:20:47,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:20:47,656 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 16:20:47,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:20:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash -817721578, now seen corresponding path program 1 times [2023-08-26 16:20:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:20:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271822615] [2023-08-26 16:20:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:20:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:20:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:20:48,113 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 16:20:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:20:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271822615] [2023-08-26 16:20:48,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271822615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:20:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109888640] [2023-08-26 16:20:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:20:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:20:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:20:48,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:20:48,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 16:20:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:20:48,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:20:48,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:22:05,002 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 16:22:05,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:22:21,406 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 16:22:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109888640] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:22:21,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:22:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-26 16:22:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82099462] [2023-08-26 16:22:21,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:22:21,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 16:22:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:22:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 16:22:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=144, Unknown=17, NotChecked=0, Total=210 [2023-08-26 16:22:21,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 256 [2023-08-26 16:22:21,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 320 transitions, 3918 flow. Second operand has 15 states, 15 states have (on average 104.93333333333334) internal successors, (1574), 15 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:22:21,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:22:21,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 256 [2023-08-26 16:22:21,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:22:23,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:22:45,853 WARN L234 SmtUtils]: Spent 18.08s on a formula simplification. DAG size of input: 64 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:22:47,911 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 16:22:49,978 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 16:22:51,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:22:53,526 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 16:22:55,678 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 16:22:57,830 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 16:22:59,841 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 16:23:01,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:23:02,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:23:04,964 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 16:23:11,226 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 16:23:13,238 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 16:23:15,245 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 16:23:17,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:11,160 WARN L234 SmtUtils]: Spent 46.47s on a formula simplification. DAG size of input: 60 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:24:13,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:15,692 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 16:24:17,701 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 16:24:19,709 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 16:24:34,271 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 16:24:36,276 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 16:24:38,285 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 16:24:40,288 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 16:24:42,293 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 16:24:44,303 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 16:24:46,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 16:24:48,313 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 16:24:50,317 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 16:24:52,321 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 16:24:54,326 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 16:24:56,332 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 16:24:58,341 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 16:25:00,381 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 16:25:02,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:04,104 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 16:25:16,126 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 16:25:18,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 16:25:18,560 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 16:25:18,568 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 16:25:19,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 16:25:19,769 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 16:25:19,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 16:25:19,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 16:25:19,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 16:25:19,777 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-08-26 16:25:19,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 21 remaining) [2023-08-26 16:25:19,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 21 remaining) [2023-08-26 16:25:19,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 21 remaining) [2023-08-26 16:25:19,780 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:25:19,782 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 16:25:19,782 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 16:25:19,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 04:25:19 BasicIcfg [2023-08-26 16:25:19,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 16:25:19,785 INFO L158 Benchmark]: Toolchain (without parser) took 871573.34ms. Allocated memory was 350.2MB in the beginning and 627.0MB in the end (delta: 276.8MB). Free memory was 327.2MB in the beginning and 404.8MB in the end (delta: -77.6MB). Peak memory consumption was 201.1MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,785 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 350.2MB. Free memory is still 326.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:25:19,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.65ms. Allocated memory is still 350.2MB. Free memory was 326.8MB in the beginning and 315.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.20ms. Allocated memory is still 350.2MB. Free memory was 315.8MB in the beginning and 314.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,786 INFO L158 Benchmark]: Boogie Preprocessor took 38.37ms. Allocated memory is still 350.2MB. Free memory was 314.1MB in the beginning and 312.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,786 INFO L158 Benchmark]: RCFGBuilder took 458.75ms. Allocated memory is still 350.2MB. Free memory was 312.6MB in the beginning and 295.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,786 INFO L158 Benchmark]: TraceAbstraction took 870740.93ms. Allocated memory was 350.2MB in the beginning and 627.0MB in the end (delta: 276.8MB). Free memory was 294.9MB in the beginning and 404.8MB in the end (delta: -109.9MB). Peak memory consumption was 169.6MB. Max. memory is 16.0GB. [2023-08-26 16:25:19,787 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.13ms. Allocated memory is still 350.2MB. Free memory is still 326.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 276.65ms. Allocated memory is still 350.2MB. Free memory was 326.8MB in the beginning and 315.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.20ms. Allocated memory is still 350.2MB. Free memory was 315.8MB in the beginning and 314.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.37ms. Allocated memory is still 350.2MB. Free memory was 314.1MB in the beginning and 312.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 458.75ms. Allocated memory is still 350.2MB. Free memory was 312.6MB in the beginning and 295.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 870740.93ms. Allocated memory was 350.2MB in the beginning and 627.0MB in the end (delta: 276.8MB). Free memory was 294.9MB in the beginning and 404.8MB in the end (delta: -109.9MB). Peak memory consumption was 169.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 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 executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 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: 870.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 648.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 133 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 344.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 909 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 342.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 193 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3404 IncrementalHoareTripleChecker+Invalid, 3818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 0 mSDtfsCounter, 3404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 258 SyntacticMatches, 13 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 424.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3918occurred in iteration=19, InterpolantAutomatonStates: 102, 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, 1.4s SatisfiabilityAnalysisTime, 214.5s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 18273 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1608 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 4/36 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