/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:20:54,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:20:54,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 19:20:54,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:20:54,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:20:54,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:20:54,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:20:54,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:20:54,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:20:54,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:20:54,518 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:20:54,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:20:54,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:20:54,520 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:20:54,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:20:54,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:20:54,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:20:54,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:20:54,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:20:54,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:20:54,521 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:20:54,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:20:54,522 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:20:54,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:20:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:20:54,523 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:20:54,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:20:54,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:20:54,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:20:54,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:20:54,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:20:54,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:20:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:20:54,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:20:54,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:20:54,526 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:20:54,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:20:54,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:20:54,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:20:54,867 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:20:54,867 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:20:54,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-08-26 19:20:56,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:20:56,291 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:20:56,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-08-26 19:20:56,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1702d8d/0c45f60c02f54bf3867e1cef5ff7602b/FLAGd548e0f4e [2023-08-26 19:20:56,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1702d8d/0c45f60c02f54bf3867e1cef5ff7602b [2023-08-26 19:20:56,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:20:56,311 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:20:56,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:20:56,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:20:56,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:20:56,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b7b20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56, skipping insertion in model container [2023-08-26 19:20:56,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:20:56,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:20:56,519 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:20:56,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:20:56,572 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:20:56,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56 WrapperNode [2023-08-26 19:20:56,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:20:56,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:20:56,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:20:56,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:20:56,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,623 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 19:20:56,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:20:56,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:20:56,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:20:56,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:20:56,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:20:56,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:20:56,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:20:56,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:20:56,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (1/1) ... [2023-08-26 19:20:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:20:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:20:56,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 19:20:56,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 19:20:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:20:56,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:20:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:20:56,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:20:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:20:56,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 19:20:56,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 19:20:56,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 19:20:56,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 19:20:56,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:20:56,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:20:56,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:20:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:20:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:20:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:20:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:20:56,749 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 19:20:56,863 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:20:56,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:20:57,144 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:20:57,151 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:20:57,152 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 19:20:57,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:20:57 BoogieIcfgContainer [2023-08-26 19:20:57,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:20:57,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:20:57,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:20:57,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:20:57,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:20:56" (1/3) ... [2023-08-26 19:20:57,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b28d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:20:57, skipping insertion in model container [2023-08-26 19:20:57,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:20:56" (2/3) ... [2023-08-26 19:20:57,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b28d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:20:57, skipping insertion in model container [2023-08-26 19:20:57,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:20:57" (3/3) ... [2023-08-26 19:20:57,161 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2023-08-26 19:20:57,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:20:57,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 19:20:57,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:20:57,259 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 19:20:57,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 152 transitions, 336 flow [2023-08-26 19:20:57,350 INFO L124 PetriNetUnfolderBase]: 10/148 cut-off events. [2023-08-26 19:20:57,350 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:20:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 148 events. 10/148 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 19:20:57,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 152 transitions, 336 flow [2023-08-26 19:20:57,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 135 transitions, 294 flow [2023-08-26 19:20:57,364 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:20:57,372 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 135 transitions, 294 flow [2023-08-26 19:20:57,374 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 135 transitions, 294 flow [2023-08-26 19:20:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 135 transitions, 294 flow [2023-08-26 19:20:57,409 INFO L124 PetriNetUnfolderBase]: 10/135 cut-off events. [2023-08-26 19:20:57,410 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:20:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 135 events. 10/135 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 19:20:57,413 INFO L119 LiptonReduction]: Number of co-enabled transitions 2736 [2023-08-26 19:21:01,993 INFO L134 LiptonReduction]: Checked pairs total: 2990 [2023-08-26 19:21:01,993 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-26 19:21:02,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:21:02,011 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;@7ee7aceb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:21:02,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 19:21:02,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:21:02,013 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 19:21:02,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:21:02,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:02,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:21:02,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:02,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2023-08-26 19:21:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143745640] [2023-08-26 19:21:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143745640] [2023-08-26 19:21:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143745640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:21:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697876422] [2023-08-26 19:21:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:02,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:21:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:21:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:21:02,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 283 [2023-08-26 19:21:02,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:02,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 283 [2023-08-26 19:21:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:02,282 INFO L124 PetriNetUnfolderBase]: 513/692 cut-off events. [2023-08-26 19:21:02,282 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-26 19:21:02,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1657 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-08-26 19:21:02,291 INFO L140 encePairwiseOnDemand]: 281/283 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 19:21:02,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-08-26 19:21:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:21:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:21:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 315 transitions. [2023-08-26 19:21:02,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565371024734982 [2023-08-26 19:21:02,311 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 315 transitions. [2023-08-26 19:21:02,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 315 transitions. [2023-08-26 19:21:02,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:02,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 315 transitions. [2023-08-26 19:21:02,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,323 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,324 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 2 states and 315 transitions. [2023-08-26 19:21:02,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-08-26 19:21:02,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 19:21:02,329 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-08-26 19:21:02,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-26 19:21:02,333 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:21:02,334 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-08-26 19:21:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:02,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:21:02,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:21:02,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:02,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 537827, now seen corresponding path program 1 times [2023-08-26 19:21:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281536116] [2023-08-26 19:21:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:02,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:02,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:02,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281536116] [2023-08-26 19:21:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281536116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:02,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:02,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421032541] [2023-08-26 19:21:02,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:02,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 283 [2023-08-26 19:21:02,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:02,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 283 [2023-08-26 19:21:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:02,810 INFO L124 PetriNetUnfolderBase]: 487/656 cut-off events. [2023-08-26 19:21:02,810 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:02,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1534 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-08-26 19:21:02,814 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 19:21:02,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-08-26 19:21:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-26 19:21:02,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43462897526501765 [2023-08-26 19:21:02,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-26 19:21:02,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-26 19:21:02,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:02,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-26 19:21:02,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,820 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 369 transitions. [2023-08-26 19:21:02,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-08-26 19:21:02,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:21:02,822 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-26 19:21:02,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-26 19:21:02,823 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:21:02,823 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-26 19:21:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:02,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:21:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:21:02,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:02,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash 537825, now seen corresponding path program 1 times [2023-08-26 19:21:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:02,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778771764] [2023-08-26 19:21:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778771764] [2023-08-26 19:21:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778771764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457560671] [2023-08-26 19:21:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:02,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 283 [2023-08-26 19:21:02,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:02,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 283 [2023-08-26 19:21:02,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:02,989 INFO L124 PetriNetUnfolderBase]: 461/620 cut-off events. [2023-08-26 19:21:02,989 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:02,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1428 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-08-26 19:21:02,993 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 19:21:02,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-08-26 19:21:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-26 19:21:02,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41813898704358066 [2023-08-26 19:21:02,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-26 19:21:02,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-26 19:21:02,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:02,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-26 19:21:02,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:02,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,001 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 355 transitions. [2023-08-26 19:21:03,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-08-26 19:21:03,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,002 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-08-26 19:21:03,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-26 19:21:03,004 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 19:21:03,004 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-08-26 19:21:03,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:21:03,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:21:03,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash 516863066, now seen corresponding path program 1 times [2023-08-26 19:21:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786184230] [2023-08-26 19:21:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786184230] [2023-08-26 19:21:03,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786184230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:03,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945887359] [2023-08-26 19:21:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:03,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:03,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:03,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 283 [2023-08-26 19:21:03,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:03,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 283 [2023-08-26 19:21:03,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:03,210 INFO L124 PetriNetUnfolderBase]: 445/596 cut-off events. [2023-08-26 19:21:03,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:03,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1362 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-08-26 19:21:03,214 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 19:21:03,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-08-26 19:21:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-26 19:21:03,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41578327444051827 [2023-08-26 19:21:03,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-26 19:21:03,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-26 19:21:03,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:03,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-26 19:21:03,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,221 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 353 transitions. [2023-08-26 19:21:03,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-08-26 19:21:03,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,223 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-08-26 19:21:03,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-26 19:21:03,225 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 19:21:03,225 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-08-26 19:21:03,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:21:03,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:21:03,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash 516863065, now seen corresponding path program 1 times [2023-08-26 19:21:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381759995] [2023-08-26 19:21:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:03,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381759995] [2023-08-26 19:21:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381759995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:03,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:03,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653850218] [2023-08-26 19:21:03,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:03,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:03,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:03,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:03,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 283 [2023-08-26 19:21:03,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:03,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 283 [2023-08-26 19:21:03,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:03,383 INFO L124 PetriNetUnfolderBase]: 429/572 cut-off events. [2023-08-26 19:21:03,384 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:03,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1290 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-08-26 19:21:03,387 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 19:21:03,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-08-26 19:21:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 19:21:03,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275618374558304 [2023-08-26 19:21:03,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 19:21:03,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 19:21:03,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:03,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 19:21:03,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,393 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 363 transitions. [2023-08-26 19:21:03,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-08-26 19:21:03,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,395 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-08-26 19:21:03,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 19:21:03,396 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:21:03,396 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-08-26 19:21:03,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:03,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:21:03,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1510789628, now seen corresponding path program 1 times [2023-08-26 19:21:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321687090] [2023-08-26 19:21:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321687090] [2023-08-26 19:21:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321687090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616929751] [2023-08-26 19:21:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:03,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:03,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:03,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 283 [2023-08-26 19:21:03,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 283 [2023-08-26 19:21:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:03,523 INFO L124 PetriNetUnfolderBase]: 403/536 cut-off events. [2023-08-26 19:21:03,523 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:03,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1186 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-08-26 19:21:03,526 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 19:21:03,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-08-26 19:21:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 19:21:03,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425206124852768 [2023-08-26 19:21:03,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 19:21:03,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 19:21:03,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:03,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 19:21:03,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,532 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 361 transitions. [2023-08-26 19:21:03,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-08-26 19:21:03,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,534 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-08-26 19:21:03,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-26 19:21:03,535 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2023-08-26 19:21:03,535 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-08-26 19:21:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:03,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:21:03,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1510789629, now seen corresponding path program 1 times [2023-08-26 19:21:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069305862] [2023-08-26 19:21:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069305862] [2023-08-26 19:21:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069305862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:03,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:03,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095431891] [2023-08-26 19:21:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:03,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:03,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:03,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:03,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 283 [2023-08-26 19:21:03,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:03,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 283 [2023-08-26 19:21:03,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:03,667 INFO L124 PetriNetUnfolderBase]: 377/500 cut-off events. [2023-08-26 19:21:03,668 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:03,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1074 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-08-26 19:21:03,670 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 19:21:03,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-08-26 19:21:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-26 19:21:03,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.408716136631331 [2023-08-26 19:21:03,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-26 19:21:03,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-26 19:21:03,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:03,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-26 19:21:03,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,675 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 347 transitions. [2023-08-26 19:21:03,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-08-26 19:21:03,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,676 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-08-26 19:21:03,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-26 19:21:03,677 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:21:03,677 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-08-26 19:21:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:21:03,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -169873200, now seen corresponding path program 1 times [2023-08-26 19:21:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555823992] [2023-08-26 19:21:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555823992] [2023-08-26 19:21:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555823992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:21:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437285133] [2023-08-26 19:21:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:03,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:21:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:21:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:21:03,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 283 [2023-08-26 19:21:03,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:03,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 283 [2023-08-26 19:21:03,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:03,839 INFO L124 PetriNetUnfolderBase]: 313/420 cut-off events. [2023-08-26 19:21:03,839 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:03,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 853 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2023-08-26 19:21:03,841 INFO L140 encePairwiseOnDemand]: 281/283 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-26 19:21:03,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-08-26 19:21:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-26 19:21:03,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3745583038869258 [2023-08-26 19:21:03,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-26 19:21:03,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-26 19:21:03,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:03,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-26 19:21:03,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,846 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 318 transitions. [2023-08-26 19:21:03,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-08-26 19:21:03,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:03,847 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-08-26 19:21:03,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-26 19:21:03,847 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:21:03,848 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-08-26 19:21:03,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:03,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:03,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:03,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:21:03,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:03,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -169873199, now seen corresponding path program 1 times [2023-08-26 19:21:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425710075] [2023-08-26 19:21:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425710075] [2023-08-26 19:21:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425710075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:21:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392353843] [2023-08-26 19:21:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:04,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:21:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:21:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:21:04,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 283 [2023-08-26 19:21:04,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:04,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 283 [2023-08-26 19:21:04,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:04,107 INFO L124 PetriNetUnfolderBase]: 249/340 cut-off events. [2023-08-26 19:21:04,107 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 19:21:04,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 645 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-08-26 19:21:04,109 INFO L140 encePairwiseOnDemand]: 281/283 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-26 19:21:04,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-08-26 19:21:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-26 19:21:04,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37691401648998824 [2023-08-26 19:21:04,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-26 19:21:04,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-26 19:21:04,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:04,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-26 19:21:04,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,113 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 320 transitions. [2023-08-26 19:21:04,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-08-26 19:21:04,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:04,115 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-08-26 19:21:04,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-26 19:21:04,115 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2023-08-26 19:21:04,115 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-08-26 19:21:04,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:04,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:04,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:21:04,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:04,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2055606495, now seen corresponding path program 1 times [2023-08-26 19:21:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517349748] [2023-08-26 19:21:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517349748] [2023-08-26 19:21:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517349748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:21:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287209221] [2023-08-26 19:21:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:04,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:21:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:21:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:21:04,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 283 [2023-08-26 19:21:04,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:04,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 283 [2023-08-26 19:21:04,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:04,435 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-26 19:21:04,435 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 19:21:04,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1786 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-08-26 19:21:04,438 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-26 19:21:04,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-08-26 19:21:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:21:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:21:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 19:21:04,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4204946996466431 [2023-08-26 19:21:04,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 19:21:04,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 19:21:04,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:04,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 19:21:04,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,443 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 357 transitions. [2023-08-26 19:21:04,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-08-26 19:21:04,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:04,445 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-08-26 19:21:04,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 19:21:04,445 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2023-08-26 19:21:04,446 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-08-26 19:21:04,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:04,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:21:04,446 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:04,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2006280990, now seen corresponding path program 1 times [2023-08-26 19:21:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541508069] [2023-08-26 19:21:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541508069] [2023-08-26 19:21:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541508069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:04,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:04,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:21:04,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377299737] [2023-08-26 19:21:04,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:04,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:21:04,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:04,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:21:04,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:21:04,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:21:04,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:04,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:21:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:04,818 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-26 19:21:04,818 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-26 19:21:04,819 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 1792 event pairs, 37 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 1645. Up to 435 conditions per place. [2023-08-26 19:21:04,822 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-26 19:21:04,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 297 flow [2023-08-26 19:21:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:21:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:21:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 19:21:04,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411660777385159 [2023-08-26 19:21:04,824 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 19:21:04,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 19:21:04,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:04,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 19:21:04,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,828 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 4 states and 466 transitions. [2023-08-26 19:21:04,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 297 flow [2023-08-26 19:21:04,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:04,830 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2023-08-26 19:21:04,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 19:21:04,831 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 19:21:04,831 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2023-08-26 19:21:04,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:04,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:04,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:21:04,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:04,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1084003670, now seen corresponding path program 1 times [2023-08-26 19:21:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402826589] [2023-08-26 19:21:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402826589] [2023-08-26 19:21:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402826589] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610766532] [2023-08-26 19:21:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:04,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:04,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:21:05,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:21:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:05,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:21:05,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:21:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:05,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:21:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610766532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:21:05,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:21:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:21:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409738734] [2023-08-26 19:21:05,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:21:05,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:21:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:21:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:21:05,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:21:05,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:05,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:05,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:21:05,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:05,637 INFO L124 PetriNetUnfolderBase]: 893/1233 cut-off events. [2023-08-26 19:21:05,637 INFO L125 PetriNetUnfolderBase]: For 592/592 co-relation queries the response was YES. [2023-08-26 19:21:05,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 1233 events. 893/1233 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4005 event pairs, 125 based on Foata normal form. 36/1269 useless extension candidates. Maximal degree in co-relation 3384. Up to 482 conditions per place. [2023-08-26 19:21:05,645 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 89 selfloop transitions, 12 changer transitions 1/102 dead transitions. [2023-08-26 19:21:05,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 102 transitions, 534 flow [2023-08-26 19:21:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:21:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:21:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2023-08-26 19:21:05,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41578327444051827 [2023-08-26 19:21:05,647 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2023-08-26 19:21:05,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2023-08-26 19:21:05,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:05,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2023-08-26 19:21:05,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:05,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:05,652 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:05,652 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 706 transitions. [2023-08-26 19:21:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 102 transitions, 534 flow [2023-08-26 19:21:05,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:21:05,656 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 187 flow [2023-08-26 19:21:05,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 19:21:05,657 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 19:21:05,657 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 187 flow [2023-08-26 19:21:05,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:05,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:05,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:05,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:21:05,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 19:21:05,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:05,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1242835776, now seen corresponding path program 1 times [2023-08-26 19:21:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148562671] [2023-08-26 19:21:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:06,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148562671] [2023-08-26 19:21:06,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148562671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:06,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:06,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:21:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985459801] [2023-08-26 19:21:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:06,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:21:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:21:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:21:06,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:21:06,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:06,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:21:06,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:06,239 INFO L124 PetriNetUnfolderBase]: 863/1203 cut-off events. [2023-08-26 19:21:06,239 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2023-08-26 19:21:06,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1203 events. 863/1203 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3853 event pairs, 175 based on Foata normal form. 30/1233 useless extension candidates. Maximal degree in co-relation 3838. Up to 997 conditions per place. [2023-08-26 19:21:06,246 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 49 selfloop transitions, 11 changer transitions 11/71 dead transitions. [2023-08-26 19:21:06,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 442 flow [2023-08-26 19:21:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:21:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:21:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 19:21:06,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411660777385159 [2023-08-26 19:21:06,248 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 19:21:06,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 19:21:06,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:06,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 19:21:06,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,251 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,252 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 187 flow. Second operand 4 states and 466 transitions. [2023-08-26 19:21:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 442 flow [2023-08-26 19:21:06,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 431 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:06,258 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 230 flow [2023-08-26 19:21:06,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 19:21:06,259 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-26 19:21:06,259 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 230 flow [2023-08-26 19:21:06,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:06,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:06,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 19:21:06,260 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:06,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1227017997, now seen corresponding path program 1 times [2023-08-26 19:21:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891551977] [2023-08-26 19:21:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891551977] [2023-08-26 19:21:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891551977] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547883416] [2023-08-26 19:21:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:06,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:21:06,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:21:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:06,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:21:06,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:21:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:06,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:21:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547883416] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:21:06,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:21:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:21:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90284157] [2023-08-26 19:21:06,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:21:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:21:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:21:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:21:06,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:21:06,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:06,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:06,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:21:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:07,065 INFO L124 PetriNetUnfolderBase]: 1541/2125 cut-off events. [2023-08-26 19:21:07,066 INFO L125 PetriNetUnfolderBase]: For 2905/2905 co-relation queries the response was YES. [2023-08-26 19:21:07,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7313 conditions, 2125 events. 1541/2125 cut-off events. For 2905/2905 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7684 event pairs, 281 based on Foata normal form. 90/2215 useless extension candidates. Maximal degree in co-relation 7302. Up to 896 conditions per place. [2023-08-26 19:21:07,081 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 103 selfloop transitions, 14 changer transitions 3/120 dead transitions. [2023-08-26 19:21:07,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 120 transitions, 797 flow [2023-08-26 19:21:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:21:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:21:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-08-26 19:21:07,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134275618374558 [2023-08-26 19:21:07,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-08-26 19:21:07,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-08-26 19:21:07,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:07,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-08-26 19:21:07,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,089 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 230 flow. Second operand 6 states and 702 transitions. [2023-08-26 19:21:07,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 120 transitions, 797 flow [2023-08-26 19:21:07,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 120 transitions, 788 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:07,097 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 292 flow [2023-08-26 19:21:07,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 19:21:07,098 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 19:21:07,098 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 292 flow [2023-08-26 19:21:07,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:07,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:07,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:21:07,304 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,SelfDestructingSolverStorable13 [2023-08-26 19:21:07,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:07,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1435493046, now seen corresponding path program 2 times [2023-08-26 19:21:07,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:07,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462341654] [2023-08-26 19:21:07,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:07,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462341654] [2023-08-26 19:21:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462341654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:21:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:21:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:21:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734958802] [2023-08-26 19:21:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:21:07,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:21:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:21:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:21:07,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-26 19:21:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:07,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-26 19:21:07,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:07,730 INFO L124 PetriNetUnfolderBase]: 1885/2599 cut-off events. [2023-08-26 19:21:07,731 INFO L125 PetriNetUnfolderBase]: For 5849/5849 co-relation queries the response was YES. [2023-08-26 19:21:07,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10416 conditions, 2599 events. 1885/2599 cut-off events. For 5849/5849 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9681 event pairs, 363 based on Foata normal form. 84/2683 useless extension candidates. Maximal degree in co-relation 10402. Up to 1525 conditions per place. [2023-08-26 19:21:07,751 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 95 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-26 19:21:07,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 780 flow [2023-08-26 19:21:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:21:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:21:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-08-26 19:21:07,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4515901060070671 [2023-08-26 19:21:07,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-08-26 19:21:07,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-08-26 19:21:07,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:07,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-08-26 19:21:07,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,803 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,803 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 292 flow. Second operand 5 states and 639 transitions. [2023-08-26 19:21:07,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 780 flow [2023-08-26 19:21:07,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 769 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:21:07,815 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 336 flow [2023-08-26 19:21:07,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=281, 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=336, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-08-26 19:21:07,816 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-26 19:21:07,816 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 336 flow [2023-08-26 19:21:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:07,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:07,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:21:07,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:07,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1235036934, now seen corresponding path program 2 times [2023-08-26 19:21:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996914480] [2023-08-26 19:21:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996914480] [2023-08-26 19:21:07,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996914480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104880812] [2023-08-26 19:21:07,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:21:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:07,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:21:07,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:21:08,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:21:08,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:21:08,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:21:08,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:21:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:08,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:21:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104880812] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:21:08,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:21:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:21:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406984484] [2023-08-26 19:21:08,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:21:08,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:21:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:21:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:21:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:21:08,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-26 19:21:08,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:08,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:21:08,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-26 19:21:08,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:21:08,587 INFO L124 PetriNetUnfolderBase]: 2379/3273 cut-off events. [2023-08-26 19:21:08,587 INFO L125 PetriNetUnfolderBase]: For 11065/11065 co-relation queries the response was YES. [2023-08-26 19:21:08,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14292 conditions, 3273 events. 2379/3273 cut-off events. For 11065/11065 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12738 event pairs, 673 based on Foata normal form. 84/3357 useless extension candidates. Maximal degree in co-relation 14275. Up to 1925 conditions per place. [2023-08-26 19:21:08,621 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 115 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-08-26 19:21:08,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 1008 flow [2023-08-26 19:21:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:21:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:21:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-26 19:21:08,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45724381625441696 [2023-08-26 19:21:08,624 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-26 19:21:08,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-26 19:21:08,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:08,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-26 19:21:08,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:08,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:08,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:08,630 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 336 flow. Second operand 5 states and 647 transitions. [2023-08-26 19:21:08,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 1008 flow [2023-08-26 19:21:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 939 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-26 19:21:08,661 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 366 flow [2023-08-26 19:21:08,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=311, 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=366, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-08-26 19:21:08,662 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-26 19:21:08,662 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 366 flow [2023-08-26 19:21:08,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:21:08,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:08,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:08,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:21:08,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:08,871 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 19:21:08,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -333743801, now seen corresponding path program 1 times [2023-08-26 19:21:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706414873] [2023-08-26 19:21:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706414873] [2023-08-26 19:21:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706414873] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122854481] [2023-08-26 19:21:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:09,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:09,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:21:09,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:21:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:10,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:21:10,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:27,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122854481] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:42,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:42,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-26 19:22:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536142433] [2023-08-26 19:22:42,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 19:22:42,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 19:22:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=143, Unknown=14, NotChecked=0, Total=210 [2023-08-26 19:22:42,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:22:42,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 366 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 19:22:42,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:42,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:22:42,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:55,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:57,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:22:59,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:03,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:05,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:07,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:09,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:11,319 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x3~0 4294967296)) (.cse0 (mod c_~n~0 4294967296)) (.cse3 (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (.cse2 (* (div c_~x2~0 4294967296) 4294967296)) (.cse4 (mod (div c_~x1~0 16) 4294967296))) (and (= (mod c_~x1~0 16) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (= .cse1 (mod c_~x4~0 4294967296)) (< 0 .cse1) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (= (mod (* 15 c_~x2~0) 16) 0) (or (<= (+ (* 4294967296 (div c_~n~0 4294967296)) c_~x2~0 268435458) (+ c_~n~0 .cse2)) (<= (+ c_~x1~0 .cse2) .cse3)) (< .cse4 .cse0) (< .cse3 (+ c_~x1~0 .cse2 1)) (= .cse4 (mod (* 4294967295 (div (* (- 1) c_~x2~0) 16)) 4294967296)))) is different from false [2023-08-26 19:23:25,865 WARN L234 SmtUtils]: Spent 11.65s on a formula simplification. DAG size of input: 48 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:23:38,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:42,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:01,029 WARN L234 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 35 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:24:05,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:09,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:11,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:13,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:15,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:17,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:19,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:22,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:24,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:26,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:29,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:31,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:32,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:37,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:39,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:44,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 19:24:46,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:48,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:50,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:52,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:53,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:56,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:58,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:01,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:03,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:05,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:06,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:10,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:12,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:14,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:19,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:21,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:23,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:25,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:26,578 INFO L124 PetriNetUnfolderBase]: 4631/6550 cut-off events. [2023-08-26 19:25:26,578 INFO L125 PetriNetUnfolderBase]: For 20781/20781 co-relation queries the response was YES. [2023-08-26 19:25:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28643 conditions, 6550 events. 4631/6550 cut-off events. For 20781/20781 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 30811 event pairs, 371 based on Foata normal form. 4/6554 useless extension candidates. Maximal degree in co-relation 28624. Up to 3955 conditions per place. [2023-08-26 19:25:26,624 INFO L140 encePairwiseOnDemand]: 265/283 looper letters, 252 selfloop transitions, 130 changer transitions 6/388 dead transitions. [2023-08-26 19:25:26,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 388 transitions, 2849 flow [2023-08-26 19:25:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 19:25:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 19:25:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2337 transitions. [2023-08-26 19:25:26,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128975265017668 [2023-08-26 19:25:26,631 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2337 transitions. [2023-08-26 19:25:26,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2337 transitions. [2023-08-26 19:25:26,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:25:26,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2337 transitions. [2023-08-26 19:25:26,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 116.85) internal successors, (2337), 20 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:25:26,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 283.0) internal successors, (5943), 21 states have internal predecessors, (5943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:25:26,643 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 283.0) internal successors, (5943), 21 states have internal predecessors, (5943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:25:26,643 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 366 flow. Second operand 20 states and 2337 transitions. [2023-08-26 19:25:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 388 transitions, 2849 flow [2023-08-26 19:25:26,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 388 transitions, 2794 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-26 19:25:26,753 INFO L231 Difference]: Finished difference. Result has 93 places, 178 transitions, 1635 flow [2023-08-26 19:25:26,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1635, PETRI_PLACES=93, PETRI_TRANSITIONS=178} [2023-08-26 19:25:26,753 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-26 19:25:26,754 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 178 transitions, 1635 flow [2023-08-26 19:25:26,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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 19:25:26,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:25:26,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:25:26,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:25:26,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 19:25:26,955 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 19:25:26,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:25:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1660772819, now seen corresponding path program 2 times [2023-08-26 19:25:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:25:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838009225] [2023-08-26 19:25:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:25:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:25:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:25:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:25:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:25:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838009225] [2023-08-26 19:25:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838009225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:25:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352817901] [2023-08-26 19:25:27,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:25:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:25:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:25:27,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:25:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 19:25:57,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:25:57,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:25:57,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-26 19:25:57,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:26:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:26:14,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:26:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:26:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352817901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:26:27,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:26:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-26 19:26:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241813305] [2023-08-26 19:26:27,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:26:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 19:26:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:26:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 19:26:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=126, Unknown=12, NotChecked=0, Total=182 [2023-08-26 19:26:27,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 283 [2023-08-26 19:26:27,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 178 transitions, 1635 flow. Second operand has 14 states, 14 states have (on average 105.5) internal successors, (1477), 14 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:26:27,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:26:27,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 283 [2023-08-26 19:26:27,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:26:31,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:35,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:39,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:41,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:51,732 WARN L234 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 48 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:26:53,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:55,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:04,300 WARN L234 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:27:07,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:09,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:11,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:13,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:15,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:17,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:19,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:23,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:25,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:28,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:30,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:32,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:34,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:36,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:38,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:40,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:42,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:44,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:55,821 WARN L234 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:27:57,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:00,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:02,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:04,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:07,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:11,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:12,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:16,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:19,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:21,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:24,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:33,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:36,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:38,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:40,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:44,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:46,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:48,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:49,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:52,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:53,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:55,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:58,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:00,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:02,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:04,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:06,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:09,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:11,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:14,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:18,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:20,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:22,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:27,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:29,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:31,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:33,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:35,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:37,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:39,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:43,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:45,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:47,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:49,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:51,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:56,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:59,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:01,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:03,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:05,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:07,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:09,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:11,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:13,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:16,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:18,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:19,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:23,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:25,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:29,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:31,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:33,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:36,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:41,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:46,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:48,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 19:30:50,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:52,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:54,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:58,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:59,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:02,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:04,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:06,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:08,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:08,669 INFO L124 PetriNetUnfolderBase]: 7330/10470 cut-off events. [2023-08-26 19:31:08,669 INFO L125 PetriNetUnfolderBase]: For 61568/61568 co-relation queries the response was YES. [2023-08-26 19:31:08,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58694 conditions, 10470 events. 7330/10470 cut-off events. For 61568/61568 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 54052 event pairs, 807 based on Foata normal form. 3/10473 useless extension candidates. Maximal degree in co-relation 58665. Up to 6003 conditions per place. [2023-08-26 19:31:08,780 INFO L140 encePairwiseOnDemand]: 267/283 looper letters, 321 selfloop transitions, 230 changer transitions 5/556 dead transitions. [2023-08-26 19:31:08,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 556 transitions, 5857 flow [2023-08-26 19:31:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 19:31:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 19:31:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1889 transitions. [2023-08-26 19:31:08,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171819787985866 [2023-08-26 19:31:08,786 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1889 transitions. [2023-08-26 19:31:08,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1889 transitions. [2023-08-26 19:31:08,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:31:08,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1889 transitions. [2023-08-26 19:31:08,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.0625) internal successors, (1889), 16 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:31:08,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 283.0) internal successors, (4811), 17 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:31:08,809 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 283.0) internal successors, (4811), 17 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:31:08,809 INFO L175 Difference]: Start difference. First operand has 93 places, 178 transitions, 1635 flow. Second operand 16 states and 1889 transitions. [2023-08-26 19:31:08,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 556 transitions, 5857 flow [2023-08-26 19:31:08,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 556 transitions, 5471 flow, removed 193 selfloop flow, removed 0 redundant places. [2023-08-26 19:31:08,994 INFO L231 Difference]: Finished difference. Result has 117 places, 353 transitions, 3802 flow [2023-08-26 19:31:08,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3802, PETRI_PLACES=117, PETRI_TRANSITIONS=353} [2023-08-26 19:31:08,995 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 67 predicate places. [2023-08-26 19:31:08,995 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 353 transitions, 3802 flow [2023-08-26 19:31:08,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 105.5) internal successors, (1477), 14 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:31:08,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:31:08,996 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:31:09,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 19:31:09,204 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 19:31:09,204 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 19:31:09,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:31:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1487150072, now seen corresponding path program 3 times [2023-08-26 19:31:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:31:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135383735] [2023-08-26 19:31:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:31:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:31:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:31:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:31:09,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:31:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135383735] [2023-08-26 19:31:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135383735] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:31:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895587203] [2023-08-26 19:31:09,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:31:09,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:31:09,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:31:09,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:31:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process Received shutdown request... [2023-08-26 19:35:27,664 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:35:27,664 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:35:28,678 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 0 [2023-08-26 19:35:28,865 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2023-08-26 19:35:28,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 137 [2023-08-26 19:35:28,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 19:35:28,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:35:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2023-08-26 19:35:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452997111] [2023-08-26 19:35:28,874 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-08-26 19:35:28,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:35:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:35:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:35:28,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:35:28,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-26 19:35:28,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 353 transitions, 3802 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:35:28,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:35:28,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-26 19:35:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:35:28,878 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 19:35:28,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 19:35:28,878 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-08-26 19:35:28,879 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 21 remaining) [2023-08-26 19:35:28,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 21 remaining) [2023-08-26 19:35:28,881 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 21 remaining) [2023-08-26 19:35:28,881 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:35:28,885 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:35:28,885 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:35:28,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:35:28 BasicIcfg [2023-08-26 19:35:28,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:35:28,887 INFO L158 Benchmark]: Toolchain (without parser) took 872576.76ms. Allocated memory was 402.7MB in the beginning and 700.4MB in the end (delta: 297.8MB). Free memory was 378.2MB in the beginning and 444.9MB in the end (delta: -66.7MB). Peak memory consumption was 234.2MB. Max. memory is 16.0GB. [2023-08-26 19:35:28,888 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 402.7MB. Free memory was 380.1MB in the beginning and 380.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:35:28,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.19ms. Allocated memory is still 402.7MB. Free memory was 378.2MB in the beginning and 366.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 19:35:28,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 402.7MB. Free memory was 366.9MB in the beginning and 364.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:35:28,888 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 402.7MB. Free memory was 364.8MB in the beginning and 363.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:35:28,888 INFO L158 Benchmark]: RCFGBuilder took 490.15ms. Allocated memory is still 402.7MB. Free memory was 363.5MB in the beginning and 345.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 19:35:28,889 INFO L158 Benchmark]: TraceAbstraction took 871731.48ms. Allocated memory was 402.7MB in the beginning and 700.4MB in the end (delta: 297.8MB). Free memory was 344.9MB in the beginning and 444.9MB in the end (delta: -100.0MB). Peak memory consumption was 200.7MB. Max. memory is 16.0GB. [2023-08-26 19:35:28,890 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.16ms. Allocated memory is still 402.7MB. Free memory was 380.1MB in the beginning and 380.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 261.19ms. Allocated memory is still 402.7MB. Free memory was 378.2MB in the beginning and 366.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 402.7MB. Free memory was 366.9MB in the beginning and 364.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 402.7MB. Free memory was 364.8MB in the beginning and 363.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 490.15ms. Allocated memory is still 402.7MB. Free memory was 363.5MB in the beginning and 345.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 871731.48ms. Allocated memory was 402.7MB in the beginning and 700.4MB in the end (delta: 297.8MB). Free memory was 344.9MB in the beginning and 444.9MB in the end (delta: -100.0MB). Peak memory consumption was 200.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 138 PlacesBefore, 50 PlacesAfterwards, 135 TransitionsBefore, 41 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 131 TotalNumberOfCompositions, 2990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2990, independent: 2990, independent conditional: 0, independent unconditional: 2990, 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: 1454, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2990, independent: 1536, independent conditional: 0, independent unconditional: 1536, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1454, unknown conditional: 0, unknown unconditional: 1454] , 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: 96]: 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: 97]: 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: 95]: 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: 94]: 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, 179 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: 871.6s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 448.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 117 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 341.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 339.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 180 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3168 IncrementalHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 0 mSDtfsCounter, 3168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 173.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3802occurred in iteration=18, InterpolantAutomatonStates: 95, 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, 31.0s SatisfiabilityAnalysisTime, 125.9s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 12250 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1146 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 5/28 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