/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --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/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:19:44,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:19:44,766 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-NoLbe.epf [2023-12-05 21:19:44,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:19:44,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:19:44,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:19:44,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:19:44,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:19:44,802 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:19:44,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:19:44,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:19:44,807 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:19:44,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:19:44,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:19:44,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:19:44,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:19:44,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:19:44,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:19:44,809 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:19:44,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:19:44,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:19:44,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:19:44,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:19:44,810 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:19:44,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:19:44,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:44,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:19:44,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:19:44,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:19:44,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:19:44,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:19:44,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:19:44,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:19:44,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true 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-12-05 21:19:45,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:19:45,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:19:45,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:19:45,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:19:45,074 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:19:45,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2023-12-05 21:19:46,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:19:46,452 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:19:46,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2023-12-05 21:19:46,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689b9389f/b3d60076bb2a4817b98ef9e1a63fb4c4/FLAG1d4430c2e [2023-12-05 21:19:46,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689b9389f/b3d60076bb2a4817b98ef9e1a63fb4c4 [2023-12-05 21:19:46,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:19:46,480 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:19:46,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:46,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:19:46,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:19:46,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dad9b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46, skipping insertion in model container [2023-12-05 21:19:46,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:19:46,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:46,725 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:19:46,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:46,770 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:19:46,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46 WrapperNode [2023-12-05 21:19:46,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:46,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:46,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:19:46,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:19:46,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,837 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 411 [2023-12-05 21:19:46,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:46,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:19:46,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:19:46,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:19:46,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:19:46,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:19:46,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:19:46,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:19:46,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (1/1) ... [2023-12-05 21:19:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:46,936 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-12-05 21:19:46,967 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-12-05 21:19:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:19:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:19:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:19:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:19:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:19:46,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:19:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:19:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:19:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:19:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 21:19:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:19:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:19:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:19:46,984 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:19:47,136 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:19:47,140 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:19:47,768 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:19:47,783 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:19:47,783 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-05 21:19:47,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:47 BoogieIcfgContainer [2023-12-05 21:19:47,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:19:47,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:19:47,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:19:47,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:19:47,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:19:46" (1/3) ... [2023-12-05 21:19:47,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4519e68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:47, skipping insertion in model container [2023-12-05 21:19:47,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:46" (2/3) ... [2023-12-05 21:19:47,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4519e68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:47, skipping insertion in model container [2023-12-05 21:19:47,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:47" (3/3) ... [2023-12-05 21:19:47,792 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2023-12-05 21:19:47,807 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:19:47,808 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-12-05 21:19:47,808 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:19:47,985 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:19:48,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 538 places, 580 transitions, 1174 flow [2023-12-05 21:19:48,263 INFO L124 PetriNetUnfolderBase]: 49/578 cut-off events. [2023-12-05 21:19:48,263 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:19:48,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 578 events. 49/578 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1849 event pairs, 0 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 395. Up to 2 conditions per place. [2023-12-05 21:19:48,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 538 places, 580 transitions, 1174 flow [2023-12-05 21:19:48,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 515 places, 556 transitions, 1121 flow [2023-12-05 21:19:48,313 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:19:48,319 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@43cf10f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:19:48,319 INFO L363 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2023-12-05 21:19:48,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:19:48,332 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-12-05 21:19:48,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:19:48,332 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:48,333 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:48,334 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:19:48,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1298560875, now seen corresponding path program 1 times [2023-12-05 21:19:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785684806] [2023-12-05 21:19:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785684806] [2023-12-05 21:19:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785684806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:48,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433362179] [2023-12-05 21:19:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:48,821 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:48,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:48,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:48,861 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 580 [2023-12-05 21:19:48,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 556 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 487.5) internal successors, (1950), 4 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:48,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:48,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 580 [2023-12-05 21:19:48,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:50,266 INFO L124 PetriNetUnfolderBase]: 1640/5618 cut-off events. [2023-12-05 21:19:50,267 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2023-12-05 21:19:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 5618 events. 1640/5618 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 58143 event pairs, 1440 based on Foata normal form. 600/4449 useless extension candidates. Maximal degree in co-relation 7678. Up to 2421 conditions per place. [2023-12-05 21:19:50,328 INFO L140 encePairwiseOnDemand]: 546/580 looper letters, 56 selfloop transitions, 8 changer transitions 4/530 dead transitions. [2023-12-05 21:19:50,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1197 flow [2023-12-05 21:19:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:19:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:19:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2515 transitions. [2023-12-05 21:19:50,400 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8672413793103448 [2023-12-05 21:19:50,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2515 transitions. [2023-12-05 21:19:50,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2515 transitions. [2023-12-05 21:19:50,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:50,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2515 transitions. [2023-12-05 21:19:50,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 503.0) internal successors, (2515), 5 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:50,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:50,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:50,432 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 2 predicate places. [2023-12-05 21:19:50,432 INFO L500 AbstractCegarLoop]: Abstraction has has 517 places, 530 transitions, 1197 flow [2023-12-05 21:19:50,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 487.5) internal successors, (1950), 4 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:50,433 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:50,434 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:50,434 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:19:50,434 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:19:50,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1298560876, now seen corresponding path program 1 times [2023-12-05 21:19:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277426677] [2023-12-05 21:19:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277426677] [2023-12-05 21:19:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277426677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:19:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515882041] [2023-12-05 21:19:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:50,779 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:19:50,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:50,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:19:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:19:50,784 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 468 out of 580 [2023-12-05 21:19:50,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 530 transitions, 1197 flow. Second operand has 8 states, 8 states have (on average 469.75) internal successors, (3758), 8 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:50,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:50,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 468 of 580 [2023-12-05 21:19:50,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:53,127 INFO L124 PetriNetUnfolderBase]: 3680/11854 cut-off events. [2023-12-05 21:19:53,128 INFO L125 PetriNetUnfolderBase]: For 1981/3322 co-relation queries the response was YES. [2023-12-05 21:19:53,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20477 conditions, 11854 events. 3680/11854 cut-off events. For 1981/3322 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 135289 event pairs, 3264 based on Foata normal form. 0/9891 useless extension candidates. Maximal degree in co-relation 19739. Up to 4245 conditions per place. [2023-12-05 21:19:53,238 INFO L140 encePairwiseOnDemand]: 558/580 looper letters, 73 selfloop transitions, 18 changer transitions 4/538 dead transitions. [2023-12-05 21:19:53,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 538 transitions, 1399 flow [2023-12-05 21:19:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:19:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:19:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3839 transitions. [2023-12-05 21:19:53,306 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8273706896551725 [2023-12-05 21:19:53,306 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3839 transitions. [2023-12-05 21:19:53,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3839 transitions. [2023-12-05 21:19:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:53,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3839 transitions. [2023-12-05 21:19:53,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 479.875) internal successors, (3839), 8 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:53,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 580.0) internal successors, (5220), 9 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:53,327 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 580.0) internal successors, (5220), 9 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:53,327 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 9 predicate places. [2023-12-05 21:19:53,327 INFO L500 AbstractCegarLoop]: Abstraction has has 524 places, 538 transitions, 1399 flow [2023-12-05 21:19:53,330 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 469.75) internal successors, (3758), 8 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:53,330 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:53,330 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:53,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:19:53,331 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:19:53,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2068275506, now seen corresponding path program 1 times [2023-12-05 21:19:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334283834] [2023-12-05 21:19:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334283834] [2023-12-05 21:19:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334283834] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:19:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069039498] [2023-12-05 21:19:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:19:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:53,808 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-12-05 21:19:53,858 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-12-05 21:19:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:53,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-05 21:19:53,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:19:54,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-05 21:19:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:54,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:19:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069039498] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:19:54,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:19:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2023-12-05 21:19:54,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734062452] [2023-12-05 21:19:54,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:19:54,439 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-05 21:19:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-05 21:19:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-12-05 21:19:54,451 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 580 [2023-12-05 21:19:54,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 538 transitions, 1399 flow. Second operand has 24 states, 24 states have (on average 467.9583333333333) internal successors, (11231), 24 states have internal predecessors, (11231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:54,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:54,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 580 [2023-12-05 21:19:54,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:57,215 INFO L124 PetriNetUnfolderBase]: 3680/11876 cut-off events. [2023-12-05 21:19:57,215 INFO L125 PetriNetUnfolderBase]: For 5612/9627 co-relation queries the response was YES. [2023-12-05 21:19:57,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24817 conditions, 11876 events. 3680/11876 cut-off events. For 5612/9627 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 135494 event pairs, 3264 based on Foata normal form. 0/9913 useless extension candidates. Maximal degree in co-relation 23840. Up to 4245 conditions per place. [2023-12-05 21:19:57,435 INFO L140 encePairwiseOnDemand]: 550/580 looper letters, 73 selfloop transitions, 36 changer transitions 4/554 dead transitions. [2023-12-05 21:19:57,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 554 transitions, 1681 flow [2023-12-05 21:19:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:19:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:19:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 7107 transitions. [2023-12-05 21:19:57,450 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8168965517241379 [2023-12-05 21:19:57,451 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 7107 transitions. [2023-12-05 21:19:57,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 7107 transitions. [2023-12-05 21:19:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 7107 transitions. [2023-12-05 21:19:57,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 473.8) internal successors, (7107), 15 states have internal predecessors, (7107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:57,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 580.0) internal successors, (9280), 16 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:57,502 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 580.0) internal successors, (9280), 16 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:57,503 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 23 predicate places. [2023-12-05 21:19:57,503 INFO L500 AbstractCegarLoop]: Abstraction has has 538 places, 554 transitions, 1681 flow [2023-12-05 21:19:57,506 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 467.9583333333333) internal successors, (11231), 24 states have internal predecessors, (11231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:57,507 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:57,507 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:57,517 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-12-05 21:19:57,714 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:19:57,715 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:19:57,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -726637582, now seen corresponding path program 2 times [2023-12-05 21:19:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064620658] [2023-12-05 21:19:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064620658] [2023-12-05 21:19:58,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064620658] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:19:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287951355] [2023-12-05 21:19:58,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:19:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:19:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:58,415 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-12-05 21:19:58,435 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-12-05 21:19:58,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:19:58,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:19:58,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-05 21:19:58,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:19:58,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-05 21:19:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:58,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:19:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:59,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287951355] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:19:59,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:19:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2023-12-05 21:19:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974265132] [2023-12-05 21:19:59,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:19:59,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-05 21:19:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-05 21:19:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2023-12-05 21:19:59,405 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 580 [2023-12-05 21:19:59,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 554 transitions, 1681 flow. Second operand has 36 states, 36 states have (on average 468.1388888888889) internal successors, (16853), 36 states have internal predecessors, (16853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:59,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:59,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 580 [2023-12-05 21:19:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:02,701 INFO L124 PetriNetUnfolderBase]: 3680/11904 cut-off events. [2023-12-05 21:20:02,701 INFO L125 PetriNetUnfolderBase]: For 11472/18161 co-relation queries the response was YES. [2023-12-05 21:20:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29207 conditions, 11904 events. 3680/11904 cut-off events. For 11472/18161 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 135610 event pairs, 3264 based on Foata normal form. 0/9941 useless extension candidates. Maximal degree in co-relation 27941. Up to 4245 conditions per place. [2023-12-05 21:20:02,843 INFO L140 encePairwiseOnDemand]: 552/580 looper letters, 85 selfloop transitions, 44 changer transitions 4/574 dead transitions. [2023-12-05 21:20:02,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 574 transitions, 2059 flow [2023-12-05 21:20:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-05 21:20:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-05 21:20:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 9457 transitions. [2023-12-05 21:20:02,863 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8152586206896552 [2023-12-05 21:20:02,863 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 9457 transitions. [2023-12-05 21:20:02,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 9457 transitions. [2023-12-05 21:20:02,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:02,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 9457 transitions. [2023-12-05 21:20:02,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 472.85) internal successors, (9457), 20 states have internal predecessors, (9457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:02,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 580.0) internal successors, (12180), 21 states have internal predecessors, (12180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:02,915 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 580.0) internal successors, (12180), 21 states have internal predecessors, (12180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:02,917 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 42 predicate places. [2023-12-05 21:20:02,917 INFO L500 AbstractCegarLoop]: Abstraction has has 557 places, 574 transitions, 2059 flow [2023-12-05 21:20:02,922 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 468.1388888888889) internal successors, (16853), 36 states have internal predecessors, (16853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:02,922 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:02,923 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:02,931 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-12-05 21:20:03,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-05 21:20:03,129 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:20:03,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash 498964146, now seen corresponding path program 3 times [2023-12-05 21:20:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158604502] [2023-12-05 21:20:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158604502] [2023-12-05 21:20:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158604502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:20:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767631662] [2023-12-05 21:20:03,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:20:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:20:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:20:03,431 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-12-05 21:20:03,452 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-12-05 21:20:03,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-05 21:20:03,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:20:03,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-05 21:20:03,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:20:03,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:20:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-05 21:20:03,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:20:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-05 21:20:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767631662] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:20:04,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:20:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 29 [2023-12-05 21:20:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211865740] [2023-12-05 21:20:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:20:04,651 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-05 21:20:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-05 21:20:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2023-12-05 21:20:04,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 580 [2023-12-05 21:20:04,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 574 transitions, 2059 flow. Second operand has 29 states, 29 states have (on average 468.51724137931035) internal successors, (13587), 29 states have internal predecessors, (13587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:04,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:04,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 580 [2023-12-05 21:20:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:08,043 INFO L124 PetriNetUnfolderBase]: 3678/11896 cut-off events. [2023-12-05 21:20:08,043 INFO L125 PetriNetUnfolderBase]: For 19501/28864 co-relation queries the response was YES. [2023-12-05 21:20:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33493 conditions, 11896 events. 3678/11896 cut-off events. For 19501/28864 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 135986 event pairs, 3264 based on Foata normal form. 0/9937 useless extension candidates. Maximal degree in co-relation 32042. Up to 4245 conditions per place. [2023-12-05 21:20:08,145 INFO L140 encePairwiseOnDemand]: 552/580 looper letters, 65 selfloop transitions, 58 changer transitions 4/568 dead transitions. [2023-12-05 21:20:08,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 568 transitions, 2249 flow [2023-12-05 21:20:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-05 21:20:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-12-05 21:20:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 13173 transitions. [2023-12-05 21:20:08,169 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8111453201970443 [2023-12-05 21:20:08,169 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 13173 transitions. [2023-12-05 21:20:08,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 13173 transitions. [2023-12-05 21:20:08,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:08,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 13173 transitions. [2023-12-05 21:20:08,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 470.4642857142857) internal successors, (13173), 28 states have internal predecessors, (13173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:08,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 580.0) internal successors, (16820), 29 states have internal predecessors, (16820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:08,227 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 580.0) internal successors, (16820), 29 states have internal predecessors, (16820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:08,230 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 67 predicate places. [2023-12-05 21:20:08,233 INFO L500 AbstractCegarLoop]: Abstraction has has 582 places, 568 transitions, 2249 flow [2023-12-05 21:20:08,237 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 468.51724137931035) internal successors, (13587), 29 states have internal predecessors, (13587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:08,237 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:08,237 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:08,246 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-12-05 21:20:08,438 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:20:08,438 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:20:08,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 837347514, now seen corresponding path program 1 times [2023-12-05 21:20:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192274041] [2023-12-05 21:20:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-05 21:20:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192274041] [2023-12-05 21:20:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192274041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:09,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:20:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124036251] [2023-12-05 21:20:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:09,039 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:20:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:20:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:20:09,042 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 580 [2023-12-05 21:20:09,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 568 transitions, 2249 flow. Second operand has 8 states, 8 states have (on average 433.5) internal successors, (3468), 8 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 580 [2023-12-05 21:20:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:10,642 INFO L124 PetriNetUnfolderBase]: 2254/7780 cut-off events. [2023-12-05 21:20:10,642 INFO L125 PetriNetUnfolderBase]: For 18082/22507 co-relation queries the response was YES. [2023-12-05 21:20:10,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24202 conditions, 7780 events. 2254/7780 cut-off events. For 18082/22507 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 86628 event pairs, 1968 based on Foata normal form. 1252/7997 useless extension candidates. Maximal degree in co-relation 22448. Up to 3465 conditions per place. [2023-12-05 21:20:10,793 INFO L140 encePairwiseOnDemand]: 571/580 looper letters, 105 selfloop transitions, 5 changer transitions 4/564 dead transitions. [2023-12-05 21:20:10,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 564 transitions, 2449 flow [2023-12-05 21:20:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:20:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:20:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1822 transitions. [2023-12-05 21:20:10,805 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7853448275862069 [2023-12-05 21:20:10,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1822 transitions. [2023-12-05 21:20:10,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1822 transitions. [2023-12-05 21:20:10,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:10,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1822 transitions. [2023-12-05 21:20:10,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 455.5) internal successors, (1822), 4 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:10,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:10,819 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:10,821 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 66 predicate places. [2023-12-05 21:20:10,821 INFO L500 AbstractCegarLoop]: Abstraction has has 581 places, 564 transitions, 2449 flow [2023-12-05 21:20:10,822 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 433.5) internal successors, (3468), 8 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:10,822 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:10,823 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:10,824 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:20:10,825 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:20:10,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1087898283, now seen corresponding path program 1 times [2023-12-05 21:20:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120753317] [2023-12-05 21:20:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-05 21:20:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120753317] [2023-12-05 21:20:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120753317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:20:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446676292] [2023-12-05 21:20:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:11,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:20:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:20:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:20:11,324 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 580 [2023-12-05 21:20:11,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 564 transitions, 2449 flow. Second operand has 9 states, 9 states have (on average 433.1111111111111) internal successors, (3898), 9 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:11,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:11,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 580 [2023-12-05 21:20:11,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:13,080 INFO L124 PetriNetUnfolderBase]: 2158/7582 cut-off events. [2023-12-05 21:20:13,080 INFO L125 PetriNetUnfolderBase]: For 20522/25329 co-relation queries the response was YES. [2023-12-05 21:20:13,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26513 conditions, 7582 events. 2158/7582 cut-off events. For 20522/25329 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 84756 event pairs, 1872 based on Foata normal form. 100/6685 useless extension candidates. Maximal degree in co-relation 25090. Up to 3267 conditions per place. [2023-12-05 21:20:13,140 INFO L140 encePairwiseOnDemand]: 561/580 looper letters, 93 selfloop transitions, 13 changer transitions 2/558 dead transitions. [2023-12-05 21:20:13,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 558 transitions, 2621 flow [2023-12-05 21:20:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:20:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:20:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2674 transitions. [2023-12-05 21:20:13,145 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7683908045977011 [2023-12-05 21:20:13,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2674 transitions. [2023-12-05 21:20:13,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2674 transitions. [2023-12-05 21:20:13,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:13,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2674 transitions. [2023-12-05 21:20:13,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 445.6666666666667) internal successors, (2674), 6 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:13,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 580.0) internal successors, (4060), 7 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:13,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 580.0) internal successors, (4060), 7 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:13,157 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 65 predicate places. [2023-12-05 21:20:13,157 INFO L500 AbstractCegarLoop]: Abstraction has has 580 places, 558 transitions, 2621 flow [2023-12-05 21:20:13,158 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 433.1111111111111) internal successors, (3898), 9 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:13,158 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:13,158 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:13,158 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:20:13,159 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:20:13,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 173607842, now seen corresponding path program 1 times [2023-12-05 21:20:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382593644] [2023-12-05 21:20:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:20:14,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382593644] [2023-12-05 21:20:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382593644] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:20:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354810887] [2023-12-05 21:20:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:20:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:20:14,196 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-12-05 21:20:14,202 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-12-05 21:20:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:14,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-05 21:20:14,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:20:14,994 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:20:14,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-05 21:20:15,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:20:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:20:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:20:15,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:20:16,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-05 21:20:16,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:20:16,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2023-12-05 21:20:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:20:16,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354810887] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:20:16,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:20:16,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 55 [2023-12-05 21:20:16,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179698726] [2023-12-05 21:20:16,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:20:16,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-05 21:20:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-05 21:20:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2023-12-05 21:20:16,950 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 580 [2023-12-05 21:20:16,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 558 transitions, 2621 flow. Second operand has 56 states, 56 states have (on average 402.125) internal successors, (22519), 56 states have internal predecessors, (22519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:16,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:16,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 580 [2023-12-05 21:20:16,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:27,333 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 [1] [2023-12-05 21:20:29,336 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 [1] [2023-12-05 21:20:31,354 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 [1] [2023-12-05 21:20:33,356 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 [1] [2023-12-05 21:20:43,407 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 [1] [2023-12-05 21:20:45,416 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 [1] [2023-12-05 21:20:47,419 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 [1] [2023-12-05 21:20:49,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-05 21:20:51,552 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 [1] [2023-12-05 21:20:53,555 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 [1] [2023-12-05 21:20:55,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-05 21:20:57,559 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 [1] [2023-12-05 21:21:07,601 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 [1] [2023-12-05 21:21:09,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-05 21:21:11,616 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 [1] [2023-12-05 21:21:13,618 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 [1] [2023-12-05 21:21:15,757 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 [1] [2023-12-05 21:21:17,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-05 21:21:19,762 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 [1] [2023-12-05 21:21:21,763 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 [1] [2023-12-05 21:21:31,805 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 [1] [2023-12-05 21:21:33,810 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 [1] [2023-12-05 21:21:35,813 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 [1] [2023-12-05 21:21:37,815 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 [1] [2023-12-05 21:21:39,937 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 [1] [2023-12-05 21:21:41,940 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 [1] [2023-12-05 21:21:43,942 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 [1] [2023-12-05 21:21:45,944 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 [1] [2023-12-05 21:21:55,983 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 [1] [2023-12-05 21:21:57,988 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 [1] [2023-12-05 21:21:59,991 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 [1] [2023-12-05 21:22:01,993 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 [1] [2023-12-05 21:22:06,270 INFO L124 PetriNetUnfolderBase]: 3610/12174 cut-off events. [2023-12-05 21:22:06,270 INFO L125 PetriNetUnfolderBase]: For 65364/80653 co-relation queries the response was YES. [2023-12-05 21:22:06,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45465 conditions, 12174 events. 3610/12174 cut-off events. For 65364/80653 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 131042 event pairs, 312 based on Foata normal form. 994/12019 useless extension candidates. Maximal degree in co-relation 43220. Up to 4560 conditions per place. [2023-12-05 21:22:06,638 INFO L140 encePairwiseOnDemand]: 531/580 looper letters, 166 selfloop transitions, 62 changer transitions 2/617 dead transitions. [2023-12-05 21:22:06,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 617 transitions, 3884 flow [2023-12-05 21:22:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-05 21:22:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-12-05 21:22:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 22147 transitions. [2023-12-05 21:22:06,668 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6942633228840125 [2023-12-05 21:22:06,669 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 22147 transitions. [2023-12-05 21:22:06,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 22147 transitions. [2023-12-05 21:22:06,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:06,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 22147 transitions. [2023-12-05 21:22:06,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 402.6727272727273) internal successors, (22147), 55 states have internal predecessors, (22147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:06,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 580.0) internal successors, (32480), 56 states have internal predecessors, (32480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:06,744 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 580.0) internal successors, (32480), 56 states have internal predecessors, (32480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:06,745 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 108 predicate places. [2023-12-05 21:22:06,746 INFO L500 AbstractCegarLoop]: Abstraction has has 623 places, 617 transitions, 3884 flow [2023-12-05 21:22:06,749 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 402.125) internal successors, (22519), 56 states have internal predecessors, (22519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:06,749 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:22:06,750 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:22:06,760 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-12-05 21:22:06,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:06,959 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:22:06,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:22:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 811972076, now seen corresponding path program 1 times [2023-12-05 21:22:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:22:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78752961] [2023-12-05 21:22:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:22:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:22:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78752961] [2023-12-05 21:22:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78752961] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:22:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234507494] [2023-12-05 21:22:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:07,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:07,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:22:07,513 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-12-05 21:22:07,517 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-12-05 21:22:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:07,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-05 21:22:07,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:22:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:08,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:22:08,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-05 21:22:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234507494] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:22:08,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:22:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2023-12-05 21:22:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347309919] [2023-12-05 21:22:08,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:22:08,648 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-05 21:22:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:22:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-05 21:22:08,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2023-12-05 21:22:08,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 580 [2023-12-05 21:22:08,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 617 transitions, 3884 flow. Second operand has 47 states, 47 states have (on average 451.1489361702128) internal successors, (21204), 47 states have internal predecessors, (21204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:08,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:22:08,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 580 [2023-12-05 21:22:08,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:12,464 INFO L124 PetriNetUnfolderBase]: 4866/15550 cut-off events. [2023-12-05 21:22:12,464 INFO L125 PetriNetUnfolderBase]: For 98165/122512 co-relation queries the response was YES. [2023-12-05 21:22:12,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64339 conditions, 15550 events. 4866/15550 cut-off events. For 98165/122512 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 167322 event pairs, 396 based on Foata normal form. 338/14386 useless extension candidates. Maximal degree in co-relation 61686. Up to 5812 conditions per place. [2023-12-05 21:22:12,632 INFO L140 encePairwiseOnDemand]: 544/580 looper letters, 178 selfloop transitions, 57 changer transitions 2/649 dead transitions. [2023-12-05 21:22:12,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 649 transitions, 4813 flow [2023-12-05 21:22:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-05 21:22:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-05 21:22:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 13659 transitions. [2023-12-05 21:22:12,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.785 [2023-12-05 21:22:12,775 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 13659 transitions. [2023-12-05 21:22:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 13659 transitions. [2023-12-05 21:22:12,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:12,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 13659 transitions. [2023-12-05 21:22:12,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 455.3) internal successors, (13659), 30 states have internal predecessors, (13659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:12,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 580.0) internal successors, (17980), 31 states have internal predecessors, (17980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:12,811 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 580.0) internal successors, (17980), 31 states have internal predecessors, (17980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:12,812 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 137 predicate places. [2023-12-05 21:22:12,812 INFO L500 AbstractCegarLoop]: Abstraction has has 652 places, 649 transitions, 4813 flow [2023-12-05 21:22:12,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 451.1489361702128) internal successors, (21204), 47 states have internal predecessors, (21204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:12,815 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:22:12,815 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:22:12,824 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-12-05 21:22:13,020 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:13,021 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:22:13,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:22:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 811972075, now seen corresponding path program 1 times [2023-12-05 21:22:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:22:13,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746043797] [2023-12-05 21:22:13,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:22:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-12-05 21:22:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:22:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746043797] [2023-12-05 21:22:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746043797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:22:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:22:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:22:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098645969] [2023-12-05 21:22:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:22:13,160 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:22:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:22:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:22:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:22:13,162 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 580 [2023-12-05 21:22:13,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 649 transitions, 4813 flow. Second operand has 6 states, 6 states have (on average 475.0) internal successors, (2850), 6 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:13,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:22:13,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 580 [2023-12-05 21:22:13,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:15,354 INFO L124 PetriNetUnfolderBase]: 3074/11722 cut-off events. [2023-12-05 21:22:15,354 INFO L125 PetriNetUnfolderBase]: For 91483/119274 co-relation queries the response was YES. [2023-12-05 21:22:15,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46149 conditions, 11722 events. 3074/11722 cut-off events. For 91483/119274 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 121575 event pairs, 656 based on Foata normal form. 753/11196 useless extension candidates. Maximal degree in co-relation 43541. Up to 3416 conditions per place. [2023-12-05 21:22:15,462 INFO L140 encePairwiseOnDemand]: 562/580 looper letters, 115 selfloop transitions, 10 changer transitions 2/622 dead transitions. [2023-12-05 21:22:15,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 622 transitions, 4739 flow [2023-12-05 21:22:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:22:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:22:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4296 transitions. [2023-12-05 21:22:15,466 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8229885057471265 [2023-12-05 21:22:15,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 4296 transitions. [2023-12-05 21:22:15,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 4296 transitions. [2023-12-05 21:22:15,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:15,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 4296 transitions. [2023-12-05 21:22:15,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 477.3333333333333) internal successors, (4296), 9 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:15,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 580.0) internal successors, (5800), 10 states have internal predecessors, (5800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:15,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 580.0) internal successors, (5800), 10 states have internal predecessors, (5800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:15,476 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 137 predicate places. [2023-12-05 21:22:15,476 INFO L500 AbstractCegarLoop]: Abstraction has has 652 places, 622 transitions, 4739 flow [2023-12-05 21:22:15,477 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 475.0) internal successors, (2850), 6 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:15,477 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:22:15,477 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:22:15,477 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:22:15,477 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:22:15,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:22:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash -817389463, now seen corresponding path program 1 times [2023-12-05 21:22:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:22:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364877943] [2023-12-05 21:22:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:22:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:22:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364877943] [2023-12-05 21:22:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364877943] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:22:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764666700] [2023-12-05 21:22:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:15,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:22:15,949 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-12-05 21:22:15,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-05 21:22:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:16,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-05 21:22:16,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:22:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:16,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:22:16,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-05 21:22:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764666700] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:22:17,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:22:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2023-12-05 21:22:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787692775] [2023-12-05 21:22:17,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:22:17,005 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-05 21:22:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:22:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-05 21:22:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2023-12-05 21:22:17,016 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 580 [2023-12-05 21:22:17,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 622 transitions, 4739 flow. Second operand has 47 states, 47 states have (on average 451.21276595744683) internal successors, (21207), 47 states have internal predecessors, (21207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:17,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:22:17,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 580 [2023-12-05 21:22:17,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:22,528 INFO L124 PetriNetUnfolderBase]: 6095/24484 cut-off events. [2023-12-05 21:22:22,529 INFO L125 PetriNetUnfolderBase]: For 232372/236017 co-relation queries the response was YES. [2023-12-05 21:22:22,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94183 conditions, 24484 events. 6095/24484 cut-off events. For 232372/236017 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 278791 event pairs, 770 based on Foata normal form. 625/22671 useless extension candidates. Maximal degree in co-relation 89363. Up to 6196 conditions per place. [2023-12-05 21:22:22,775 INFO L140 encePairwiseOnDemand]: 547/580 looper letters, 253 selfloop transitions, 57 changer transitions 2/734 dead transitions. [2023-12-05 21:22:22,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 734 transitions, 7651 flow [2023-12-05 21:22:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-05 21:22:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-05 21:22:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 13619 transitions. [2023-12-05 21:22:22,785 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7827011494252873 [2023-12-05 21:22:22,785 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 13619 transitions. [2023-12-05 21:22:22,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 13619 transitions. [2023-12-05 21:22:22,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:22,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 13619 transitions. [2023-12-05 21:22:22,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 453.96666666666664) internal successors, (13619), 30 states have internal predecessors, (13619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:22,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 580.0) internal successors, (17980), 31 states have internal predecessors, (17980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:22,814 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 580.0) internal successors, (17980), 31 states have internal predecessors, (17980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:22,814 INFO L308 CegarLoopForPetriNet]: 515 programPoint places, 163 predicate places. [2023-12-05 21:22:22,815 INFO L500 AbstractCegarLoop]: Abstraction has has 678 places, 734 transitions, 7651 flow [2023-12-05 21:22:22,817 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 451.21276595744683) internal successors, (21207), 47 states have internal predecessors, (21207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:22,817 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:22:22,817 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:22:22,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-05 21:22:23,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:23,025 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:22:23,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:22:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1616640195, now seen corresponding path program 1 times [2023-12-05 21:22:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:22:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622062981] [2023-12-05 21:22:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:22:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:22:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622062981] [2023-12-05 21:22:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622062981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:22:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194453111] [2023-12-05 21:22:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:23,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:22:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:22:23,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:22:23,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-05 21:22:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:24,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-05 21:22:24,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:22:24,534 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:22:24,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-05 21:22:24,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:22:24,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:22:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:24,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:22:25,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-05 21:22:26,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:22:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2023-12-05 21:22:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-05 21:22:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194453111] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:22:26,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:22:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 55 [2023-12-05 21:22:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757001080] [2023-12-05 21:22:26,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:22:26,248 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-05 21:22:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:22:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-05 21:22:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2023-12-05 21:22:26,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 580 [2023-12-05 21:22:26,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 734 transitions, 7651 flow. Second operand has 56 states, 56 states have (on average 402.2857142857143) internal successors, (22528), 56 states have internal predecessors, (22528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:22:26,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:22:26,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 580 [2023-12-05 21:22:26,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:36,573 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 [1] [2023-12-05 21:22:38,575 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 [1] [2023-12-05 21:22:40,576 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 [1] [2023-12-05 21:22:42,578 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 [1] [2023-12-05 21:22:52,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-05 21:22:54,617 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 [1] [2023-12-05 21:22:56,619 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 [1] [2023-12-05 21:22:58,660 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 [1] [2023-12-05 21:23:00,769 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 [1] [2023-12-05 21:23:02,774 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 [1] [2023-12-05 21:23:04,776 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 [1] [2023-12-05 21:23:06,778 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 [1] [2023-12-05 21:23:16,813 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 [1] [2023-12-05 21:23:18,815 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 [1] [2023-12-05 21:23:20,816 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 [1] [2023-12-05 21:23:22,823 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 [1] [2023-12-05 21:23:24,930 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 [1] [2023-12-05 21:23:26,931 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 [1] [2023-12-05 21:23:28,934 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 [1] [2023-12-05 21:23:30,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 [1] [2023-12-05 21:23:40,971 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 [1] [2023-12-05 21:23:42,973 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 [1] [2023-12-05 21:23:44,975 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 [1] [2023-12-05 21:23:46,991 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 [1] [2023-12-05 21:23:49,092 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 [1] [2023-12-05 21:23:51,094 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 [1] [2023-12-05 21:23:53,095 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 [1] [2023-12-05 21:23:55,097 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 [1] Received shutdown request... [2023-12-05 21:24:02,799 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-12-05 21:24:02,799 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:24:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-05 21:24:03,122 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 78 remaining) [2023-12-05 21:24:03,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-05 21:24:03,323 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:24:03,323 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. [2023-12-05 21:24:03,324 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 78 remaining) [2023-12-05 21:24:03,324 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 78 remaining) [2023-12-05 21:24:03,325 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 78 remaining) [2023-12-05 21:24:03,326 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 78 remaining) [2023-12-05 21:24:03,327 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 78 remaining) [2023-12-05 21:24:03,328 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 78 remaining) [2023-12-05 21:24:03,329 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 78 remaining) [2023-12-05 21:24:03,330 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 78 remaining) [2023-12-05 21:24:03,331 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 78 remaining) [2023-12-05 21:24:03,331 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 78 remaining) [2023-12-05 21:24:03,331 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 78 remaining) [2023-12-05 21:24:03,331 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 78 remaining) [2023-12-05 21:24:03,331 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:24:03,336 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:24:03,336 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:24:03,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:24:03 BasicIcfg [2023-12-05 21:24:03,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:24:03,339 INFO L158 Benchmark]: Toolchain (without parser) took 256859.73ms. Allocated memory was 405.8MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 353.9MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-05 21:24:03,340 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 239.1MB. Free memory is still 188.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:24:03,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.25ms. Allocated memory is still 405.8MB. Free memory was 353.4MB in the beginning and 340.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-05 21:24:03,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.11ms. Allocated memory is still 405.8MB. Free memory was 340.1MB in the beginning and 336.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:24:03,340 INFO L158 Benchmark]: Boogie Preprocessor took 63.87ms. Allocated memory is still 405.8MB. Free memory was 336.6MB in the beginning and 334.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:24:03,340 INFO L158 Benchmark]: RCFGBuilder took 881.94ms. Allocated memory is still 405.8MB. Free memory was 334.0MB in the beginning and 292.6MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-05 21:24:03,341 INFO L158 Benchmark]: TraceAbstraction took 255552.15ms. Allocated memory was 405.8MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 291.5MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-05 21:24:03,342 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.12ms. Allocated memory is still 239.1MB. Free memory is still 188.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.25ms. Allocated memory is still 405.8MB. Free memory was 353.4MB in the beginning and 340.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.11ms. Allocated memory is still 405.8MB. Free memory was 340.1MB in the beginning and 336.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.87ms. Allocated memory is still 405.8MB. Free memory was 336.6MB in the beginning and 334.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 881.94ms. Allocated memory is still 405.8MB. Free memory was 334.0MB in the beginning and 292.6MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 255552.15ms. Allocated memory was 405.8MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 291.5MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 876 locations, 78 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: 255.3s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 236.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 60 mSolverCounterUnknown, 3059 SdHoareTripleChecker+Valid, 125.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3059 mSDsluCounter, 4164 SdHoareTripleChecker+Invalid, 125.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3608 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11904 IncrementalHoareTripleChecker+Invalid, 12239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 556 mSDtfsCounter, 11904 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2817 GetRequests, 2323 SyntacticMatches, 9 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8335 ImplicationChecksByTransitivity, 81.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7651occurred in iteration=11, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 3273 NumberOfCodeBlocks, 3245 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4481 ConstructedInterpolants, 114 QuantifiedInterpolants, 28859 SizeOfPredicates, 101 NumberOfNonLiveVariables, 2557 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 2079/2604 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