/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 -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:05:53,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:05:53,699 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-SemanticLbe.epf [2023-11-17 15:05:53,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:05:53,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:05:53,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:05:53,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:05:53,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:05:53,725 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:05:53,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:05:53,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:05:53,729 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:05:53,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:05:53,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:05:53,731 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:05:53,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:05:53,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:05:53,732 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:05:53,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:05:53,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:05:53,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:05:53,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:05:53,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:05:53,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:05:53,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:05:53,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:05:53,735 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 [2023-11-17 15:05:53,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:05:53,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:05:53,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:05:53,943 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:05:53,944 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:05:53,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-17 15:05:55,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:05:55,253 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:05:55,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-17 15:05:55,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a1c5c17/ed08674b8ab342b28e0ef5c69e95d1aa/FLAG131072346 [2023-11-17 15:05:55,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a1c5c17/ed08674b8ab342b28e0ef5c69e95d1aa [2023-11-17 15:05:55,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:05:55,298 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:05:55,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:05:55,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:05:55,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:05:55,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc160ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55, skipping insertion in model container [2023-11-17 15:05:55,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,345 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:05:55,549 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-17 15:05:55,560 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-17 15:05:55,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:05:55,577 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:05:55,605 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-17 15:05:55,608 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-17 15:05:55,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:05:55,635 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:05:55,635 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:05:55,640 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:05:55,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55 WrapperNode [2023-11-17 15:05:55,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:05:55,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:05:55,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:05:55,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:05:55,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,692 INFO L138 Inliner]: procedures = 174, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2023-11-17 15:05:55,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:05:55,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:05:55,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:05:55,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:05:55,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:05:55,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:05:55,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:05:55,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:05:55,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (1/1) ... [2023-11-17 15:05:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:05:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:05:55,770 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-11-17 15:05:55,836 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-11-17 15:05:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:05:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 15:05:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 15:05:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:05:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:05:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:05:55,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:05:55,853 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:05:55,979 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:05:55,981 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:05:56,178 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:05:56,305 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:05:56,305 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 15:05:56,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:05:56 BoogieIcfgContainer [2023-11-17 15:05:56,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:05:56,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:05:56,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:05:56,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:05:56,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:05:55" (1/3) ... [2023-11-17 15:05:56,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3d0c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:56, skipping insertion in model container [2023-11-17 15:05:56,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:55" (2/3) ... [2023-11-17 15:05:56,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3d0c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:56, skipping insertion in model container [2023-11-17 15:05:56,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:05:56" (3/3) ... [2023-11-17 15:05:56,318 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-11-17 15:05:56,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:05:56,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:05:56,331 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:05:56,398 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:05:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,472 INFO L124 PetriNetUnfolderBase]: 11/109 cut-off events. [2023-11-17 15:05:56,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:56,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 11/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 224 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2023-11-17 15:05:56,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,482 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:05:56,495 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,498 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 98 transitions, 200 flow [2023-11-17 15:05:56,528 INFO L124 PetriNetUnfolderBase]: 11/109 cut-off events. [2023-11-17 15:05:56,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:56,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 11/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 224 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2023-11-17 15:05:56,531 INFO L119 LiptonReduction]: Number of co-enabled transitions 1820 [2023-11-17 15:06:00,139 INFO L134 LiptonReduction]: Checked pairs total: 2241 [2023-11-17 15:06:00,139 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-11-17 15:06:00,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:06:00,162 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1b9d876c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:06:00,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:06:00,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:06:00,165 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2023-11-17 15:06:00,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:06:00,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:00,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:06:00,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:06:00,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 840234535, now seen corresponding path program 1 times [2023-11-17 15:06:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878463095] [2023-11-17 15:06:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:06:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:06:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:06:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878463095] [2023-11-17 15:06:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878463095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:06:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:06:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:06:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026969437] [2023-11-17 15:06:00,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:06:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:06:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:06:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:06:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:06:00,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189 [2023-11-17 15:06:00,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 24 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:00,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:06:00,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189 [2023-11-17 15:06:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:06:00,438 INFO L124 PetriNetUnfolderBase]: 37/76 cut-off events. [2023-11-17 15:06:00,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:06:00,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 76 events. 37/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 186 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 144. Up to 76 conditions per place. [2023-11-17 15:06:00,440 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 20 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-17 15:06:00,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 86 flow [2023-11-17 15:06:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:06:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:06:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 189 transitions. [2023-11-17 15:06:00,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 15:06:00,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 189 transitions. [2023-11-17 15:06:00,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 189 transitions. [2023-11-17 15:06:00,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:06:00,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 189 transitions. [2023-11-17 15:06:00,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:00,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:00,467 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:00,469 INFO L175 Difference]: Start difference. First operand has 20 places, 24 transitions, 52 flow. Second operand 2 states and 189 transitions. [2023-11-17 15:06:00,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 86 flow [2023-11-17 15:06:00,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:06:00,472 INFO L231 Difference]: Finished difference. Result has 20 places, 21 transitions, 46 flow [2023-11-17 15:06:00,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=20, PETRI_TRANSITIONS=21} [2023-11-17 15:06:00,476 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2023-11-17 15:06:00,476 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 21 transitions, 46 flow [2023-11-17 15:06:00,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:00,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:00,477 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-17 15:06:00,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:06:00,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:06:00,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 840183366, now seen corresponding path program 1 times [2023-11-17 15:06:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141412548] [2023-11-17 15:06:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:06:00,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:06:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:06:00,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:06:00,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:06:00,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-17 15:06:00,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:06:00,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-17 15:06:00,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-17 15:06:00,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:06:00,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:06:00,539 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 15:06:00,540 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 15:06:00,541 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 15:06:00,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:06:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,606 INFO L124 PetriNetUnfolderBase]: 21/188 cut-off events. [2023-11-17 15:06:00,606 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:06:00,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 188 events. 21/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 600 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2023-11-17 15:06:00,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,612 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:06:00,612 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,613 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 164 transitions, 338 flow [2023-11-17 15:06:00,630 INFO L124 PetriNetUnfolderBase]: 21/188 cut-off events. [2023-11-17 15:06:00,631 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:06:00,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 188 events. 21/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 600 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2023-11-17 15:06:00,638 INFO L119 LiptonReduction]: Number of co-enabled transitions 12220 [2023-11-17 15:06:35,490 INFO L134 LiptonReduction]: Checked pairs total: 17473 [2023-11-17 15:06:35,491 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-17 15:06:35,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:06:35,493 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1b9d876c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:06:35,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:06:35,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:06:35,495 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-11-17 15:06:35,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:06:35,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:35,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:06:35,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:06:35,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -971908442, now seen corresponding path program 1 times [2023-11-17 15:06:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50885143] [2023-11-17 15:06:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:06:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:06:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:06:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50885143] [2023-11-17 15:06:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50885143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:06:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:06:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:06:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912026716] [2023-11-17 15:06:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:06:35,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:06:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:06:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:06:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:06:35,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 310 [2023-11-17 15:06:35,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:35,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:06:35,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 310 [2023-11-17 15:06:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:06:36,127 INFO L124 PetriNetUnfolderBase]: 1065/1643 cut-off events. [2023-11-17 15:06:36,128 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-17 15:06:36,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8569 event pairs, 735 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2023-11-17 15:06:36,134 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-11-17 15:06:36,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 192 flow [2023-11-17 15:06:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:06:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:06:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2023-11-17 15:06:36,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177419354838709 [2023-11-17 15:06:36,139 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 321 transitions. [2023-11-17 15:06:36,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions. [2023-11-17 15:06:36,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:06:36,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions. [2023-11-17 15:06:36,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:36,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:36,143 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:36,143 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 114 flow. Second operand 2 states and 321 transitions. [2023-11-17 15:06:36,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 192 flow [2023-11-17 15:06:36,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:06:36,145 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-11-17 15:06:36,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2023-11-17 15:06:36,145 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-11-17 15:06:36,145 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-11-17 15:06:36,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:36,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:36,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:06:36,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:06:36,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:06:36,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1987541724, now seen corresponding path program 1 times [2023-11-17 15:06:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483387769] [2023-11-17 15:06:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:06:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:06:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:06:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483387769] [2023-11-17 15:06:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483387769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:06:36,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:06:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:06:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105159287] [2023-11-17 15:06:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:06:36,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:06:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:06:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:06:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:06:36,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 310 [2023-11-17 15:06:36,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:36,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:06:36,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 310 [2023-11-17 15:06:36,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:06:38,181 INFO L124 PetriNetUnfolderBase]: 875/1381 cut-off events. [2023-11-17 15:06:38,181 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-17 15:06:38,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1381 events. 875/1381 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7480 event pairs, 277 based on Foata normal form. 0/1015 useless extension candidates. Maximal degree in co-relation 2786. Up to 1181 conditions per place. [2023-11-17 15:06:38,187 INFO L140 encePairwiseOnDemand]: 303/310 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-11-17 15:06:38,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 253 flow [2023-11-17 15:06:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:06:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:06:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-17 15:06:38,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311827956989247 [2023-11-17 15:06:38,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-17 15:06:38,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-17 15:06:38,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:06:38,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-17 15:06:38,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:38,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:38,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:38,193 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 3 states and 401 transitions. [2023-11-17 15:06:38,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 253 flow [2023-11-17 15:06:38,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 253 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:06:38,195 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 129 flow [2023-11-17 15:06:38,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2023-11-17 15:06:38,196 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-11-17 15:06:38,197 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 129 flow [2023-11-17 15:06:38,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:38,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:38,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:06:38,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:06:38,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:06:38,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1993607685, now seen corresponding path program 1 times [2023-11-17 15:06:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722327065] [2023-11-17 15:06:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:06:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:06:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:06:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722327065] [2023-11-17 15:06:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722327065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:06:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:06:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:06:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035438351] [2023-11-17 15:06:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:06:39,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:06:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:06:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:06:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:06:39,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 310 [2023-11-17 15:06:39,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:39,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:06:39,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 310 [2023-11-17 15:06:39,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:06:45,288 INFO L124 PetriNetUnfolderBase]: 1506/2356 cut-off events. [2023-11-17 15:06:45,288 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2023-11-17 15:06:45,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5094 conditions, 2356 events. 1506/2356 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 13400 event pairs, 230 based on Foata normal form. 32/1937 useless extension candidates. Maximal degree in co-relation 5087. Up to 1402 conditions per place. [2023-11-17 15:06:45,299 INFO L140 encePairwiseOnDemand]: 294/310 looper letters, 123 selfloop transitions, 33 changer transitions 0/159 dead transitions. [2023-11-17 15:06:45,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 159 transitions, 728 flow [2023-11-17 15:06:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:06:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:06:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1191 transitions. [2023-11-17 15:06:45,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34926686217008795 [2023-11-17 15:06:45,302 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1191 transitions. [2023-11-17 15:06:45,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1191 transitions. [2023-11-17 15:06:45,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:06:45,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1191 transitions. [2023-11-17 15:06:45,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 108.27272727272727) internal successors, (1191), 11 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:45,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:45,309 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:45,309 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 129 flow. Second operand 11 states and 1191 transitions. [2023-11-17 15:06:45,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 159 transitions, 728 flow [2023-11-17 15:06:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 159 transitions, 719 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:06:45,312 INFO L231 Difference]: Finished difference. Result has 64 places, 82 transitions, 383 flow [2023-11-17 15:06:45,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=64, PETRI_TRANSITIONS=82} [2023-11-17 15:06:45,313 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2023-11-17 15:06:45,313 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 82 transitions, 383 flow [2023-11-17 15:06:45,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:06:45,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:06:45,313 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-17 15:06:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:06:45,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:06:45,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:06:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1034475896, now seen corresponding path program 1 times [2023-11-17 15:06:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:06:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34856127] [2023-11-17 15:06:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:06:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:06:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:06:45,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:06:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:06:45,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:06:45,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:06:45,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-17 15:06:45,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:06:45,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-11-17 15:06:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-11-17 15:06:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-11-17 15:06:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-11-17 15:06:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:06:45,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:06:45,330 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-17 15:06:45,331 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 15:06:45,331 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 15:06:45,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:06:45,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,404 INFO L124 PetriNetUnfolderBase]: 31/267 cut-off events. [2023-11-17 15:06:45,404 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 15:06:45,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 267 events. 31/267 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1008 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 208. Up to 8 conditions per place. [2023-11-17 15:06:45,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,408 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:06:45,409 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,410 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 230 transitions, 478 flow [2023-11-17 15:06:45,431 INFO L124 PetriNetUnfolderBase]: 31/267 cut-off events. [2023-11-17 15:06:45,431 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 15:06:45,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 267 events. 31/267 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1008 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 208. Up to 8 conditions per place. [2023-11-17 15:06:45,442 INFO L119 LiptonReduction]: Number of co-enabled transitions 31200 [2023-11-17 15:07:57,828 INFO L134 LiptonReduction]: Checked pairs total: 51490 [2023-11-17 15:07:57,828 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-11-17 15:07:57,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:07:57,830 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1b9d876c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:07:57,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-17 15:07:57,831 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:07:57,831 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-11-17 15:07:57,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:07:57,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:07:57,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:07:57,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-17 15:07:57,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:07:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1015347480, now seen corresponding path program 1 times [2023-11-17 15:07:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:07:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208017053] [2023-11-17 15:07:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:07:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:07:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:07:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:07:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:07:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208017053] [2023-11-17 15:07:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208017053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:07:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:07:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:07:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761480465] [2023-11-17 15:07:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:07:57,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:07:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:07:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:07:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:07:57,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 436 [2023-11-17 15:07:57,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 168 flow. Second operand has 2 states, 2 states have (on average 192.0) internal successors, (384), 2 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:07:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:07:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 436 [2023-11-17 15:07:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:08:01,388 INFO L124 PetriNetUnfolderBase]: 27945/37185 cut-off events. [2023-11-17 15:08:01,388 INFO L125 PetriNetUnfolderBase]: For 2032/2032 co-relation queries the response was YES. [2023-11-17 15:08:01,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74947 conditions, 37185 events. 27945/37185 cut-off events. For 2032/2032 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 218620 event pairs, 19935 based on Foata normal form. 0/25595 useless extension candidates. Maximal degree in co-relation 3321. Up to 36684 conditions per place. [2023-11-17 15:08:01,597 INFO L140 encePairwiseOnDemand]: 429/436 looper letters, 65 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-11-17 15:08:01,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 284 flow [2023-11-17 15:08:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:08:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:08:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-11-17 15:08:01,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160550458715596 [2023-11-17 15:08:01,599 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-11-17 15:08:01,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-11-17 15:08:01,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:08:01,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-11-17 15:08:01,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.0) internal successors, (450), 2 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:01,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 436.0) internal successors, (1308), 3 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:01,602 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 436.0) internal successors, (1308), 3 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:01,602 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 168 flow. Second operand 2 states and 450 transitions. [2023-11-17 15:08:01,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 284 flow [2023-11-17 15:08:01,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 282 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 15:08:01,606 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 152 flow [2023-11-17 15:08:01,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-11-17 15:08:01,607 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-11-17 15:08:01,607 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 152 flow [2023-11-17 15:08:01,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 192.0) internal successors, (384), 2 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:01,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:08:01,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:08:01,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:08:01,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-17 15:08:01,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:08:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 798085809, now seen corresponding path program 1 times [2023-11-17 15:08:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:08:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38148204] [2023-11-17 15:08:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:08:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:08:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:08:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:08:02,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:08:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38148204] [2023-11-17 15:08:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38148204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:08:02,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:08:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:08:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675201845] [2023-11-17 15:08:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:08:02,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:08:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:08:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:08:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:08:02,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 436 [2023-11-17 15:08:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:02,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:08:02,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 436 [2023-11-17 15:08:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:08:10,039 INFO L124 PetriNetUnfolderBase]: 26054/34695 cut-off events. [2023-11-17 15:08:10,039 INFO L125 PetriNetUnfolderBase]: For 1149/1149 co-relation queries the response was YES. [2023-11-17 15:08:10,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69933 conditions, 34695 events. 26054/34695 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 206095 event pairs, 5964 based on Foata normal form. 0/24627 useless extension candidates. Maximal degree in co-relation 69927. Up to 32393 conditions per place. [2023-11-17 15:08:10,224 INFO L140 encePairwiseOnDemand]: 414/436 looper letters, 136 selfloop transitions, 32 changer transitions 0/171 dead transitions. [2023-11-17 15:08:10,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 171 transitions, 744 flow [2023-11-17 15:08:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:08:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:08:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1293 transitions. [2023-11-17 15:08:10,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3706995412844037 [2023-11-17 15:08:10,228 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1293 transitions. [2023-11-17 15:08:10,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1293 transitions. [2023-11-17 15:08:10,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:08:10,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1293 transitions. [2023-11-17 15:08:10,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 161.625) internal successors, (1293), 8 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:10,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 436.0) internal successors, (3924), 9 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:10,235 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 436.0) internal successors, (3924), 9 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:10,235 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 152 flow. Second operand 8 states and 1293 transitions. [2023-11-17 15:08:10,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 171 transitions, 744 flow [2023-11-17 15:08:10,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 171 transitions, 744 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:08:10,239 INFO L231 Difference]: Finished difference. Result has 74 places, 99 transitions, 413 flow [2023-11-17 15:08:10,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=413, PETRI_PLACES=74, PETRI_TRANSITIONS=99} [2023-11-17 15:08:10,239 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2023-11-17 15:08:10,240 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 99 transitions, 413 flow [2023-11-17 15:08:10,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:10,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:08:10,240 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:08:10,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:08:10,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-17 15:08:10,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:08:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1167082095, now seen corresponding path program 1 times [2023-11-17 15:08:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:08:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926787279] [2023-11-17 15:08:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:08:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:08:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:08:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:08:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:08:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926787279] [2023-11-17 15:08:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926787279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:08:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619692896] [2023-11-17 15:08:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:08:12,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:08:12,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:08:12,258 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-11-17 15:08:12,262 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-11-17 15:08:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:08:12,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 15:08:12,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:08:12,847 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-17 15:08:12,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-17 15:08:13,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-17 15:08:14,054 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-17 15:08:14,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-17 15:08:15,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 75 [2023-11-17 15:08:15,121 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:08:15,122 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2023-11-17 15:08:15,156 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-11-17 15:08:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 15:08:15,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 80 [2023-11-17 15:08:15,314 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:08:15,315 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2023-11-17 15:08:15,339 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-11-17 15:08:15,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2023-11-17 15:08:15,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2023-11-17 15:08:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2023-11-17 15:08:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:08:17,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:08:17,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (< (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) is different from false [2023-11-17 15:08:18,886 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:08:18,887 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 187 [2023-11-17 15:08:19,126 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:08:19,126 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2023-11-17 15:08:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 15:08:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619692896] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:08:23,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:08:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-11-17 15:08:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363767720] [2023-11-17 15:08:23,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:08:23,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 15:08:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:08:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 15:08:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=289, Unknown=9, NotChecked=36, Total=420 [2023-11-17 15:08:23,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 436 [2023-11-17 15:08:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 99 transitions, 413 flow. Second operand has 21 states, 21 states have (on average 136.28571428571428) internal successors, (2862), 21 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:08:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 436 [2023-11-17 15:08:23,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:08:25,684 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (= |c_~#value~0.base| |c_~#inc_flag~0.base|)) (.cse7 (mod .cse38 4294967296)) (.cse10 (+ 1 .cse38)) (.cse11 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (let ((.cse25 (forall ((|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse35 (store (let ((.cse37 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse36 (store (select .cse37 |c_~#value~0.base|) |c_~#value~0.offset| .cse10))) (store (store |c_#memory_int| |c_~#value~0.base| .cse36) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse37 |c_~#value~0.base| .cse36) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (< .cse7 (mod (select (select .cse35 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse35 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (.cse12 (not .cse0)) (.cse24 (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#inc_flag~0.base|)) (.cse23 (not (= (select |c_#valid| |c_~#inc_flag~0.base|) 0)))) (and (or .cse0 (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse1 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (store (let ((.cse4 (store .cse5 |c_~#inc_flag~0.base| (store (select .cse5 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse3 (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse1 1)))) (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_6) |c_~#value~0.base| .cse3) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse4 |c_~#value~0.base| .cse3) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (= |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) (< (mod .cse1 4294967296) (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))))) (or (forall ((|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse6 (store (let ((.cse9 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse8 (store (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset| .cse10))) (store (store |c_#memory_int| |c_~#value~0.base| .cse8) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse9 |c_~#value~0.base| .cse8) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse7 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse12) (or (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse13 (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse14 (store (let ((.cse16 (store .cse17 |c_~#inc_flag~0.base| (store (select .cse17 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse15 (store (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse13 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse15) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse16 |c_~#value~0.base| .cse15) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (< (mod .cse13 4294967296) (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse14 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) .cse12) (or (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse19 (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse18 (store (let ((.cse21 (store .cse22 |c_~#inc_flag~0.base| (store (select .cse22 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse20 (store (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse19 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse20) |c_~#inc_flag~0.base| (store (select (store .cse21 |c_~#value~0.base| .cse20) |c_~#inc_flag~0.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (mod (select (select .cse18 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod .cse19 4294967296) (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) .cse23) (or (not .cse24) .cse25) (or .cse25 .cse12) (or .cse0 (forall ((|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse26 (store (let ((.cse28 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse27 (store (select .cse28 |c_~#value~0.base|) |c_~#value~0.offset| .cse10))) (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_6) |c_~#value~0.base| .cse27) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse28 |c_~#value~0.base| .cse27) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (= |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) (not (= (mod (select (select .cse26 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse7 (mod (select (select .cse26 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or .cse0 (forall ((|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse29 (store (let ((.cse31 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse30 (store (select .cse31 |c_~#value~0.base|) |c_~#value~0.offset| .cse10))) (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_6) |c_~#value~0.base| .cse30) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse31 |c_~#value~0.base| .cse30) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (mod (select (select .cse29 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse7 (mod (select (select .cse29 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse24) (or (forall ((|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse32 (store (let ((.cse34 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse33 (store (select .cse34 |c_~#value~0.base|) |c_~#value~0.offset| .cse10))) (store (store |c_#memory_int| |c_~#value~0.base| .cse33) |c_~#inc_flag~0.base| (store (select (store .cse34 |c_~#value~0.base| .cse33) |c_~#inc_flag~0.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (< .cse7 (mod (select (select .cse32 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse32 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) .cse23))))) is different from false [2023-11-17 15:08:43,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:46,008 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-11-17 15:08:49,643 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-11-17 15:08:51,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:53,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:57,535 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-11-17 15:08:59,868 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-11-17 15:09:11,891 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-11-17 15:09:16,093 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-11-17 15:09:18,841 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-11-17 15:09:21,084 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-11-17 15:09:23,097 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-11-17 15:09:25,742 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-11-17 15:09:27,786 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-11-17 15:09:30,021 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-11-17 15:09:31,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:09:33,863 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-11-17 15:09:35,869 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-11-17 15:09:37,877 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-11-17 15:09:42,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:09:51,117 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-11-17 15:09:53,277 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-11-17 15:09:55,405 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-11-17 15:09:58,044 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-11-17 15:10:00,540 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-11-17 15:10:05,433 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-11-17 15:10:07,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:10:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:10:14,574 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-11-17 15:10:16,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:10:18,724 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-11-17 15:10:20,758 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-11-17 15:10:22,769 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-11-17 15:10:24,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:10:33,642 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-11-17 15:10:34,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (= |c_~#value~0.base| |c_~#inc_flag~0.base|)) (.cse20 (mod .cse28 4294967296)) (.cse23 (+ 1 .cse28)) (.cse24 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (let ((.cse18 (forall ((|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse25 (store (let ((.cse27 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse24 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse26 (store (select .cse27 |c_~#value~0.base|) |c_~#value~0.offset| .cse23))) (store (store |c_#memory_int| |c_~#value~0.base| .cse26) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse27 |c_~#value~0.base| .cse26) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (< .cse20 (mod (select (select .cse25 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse25 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (.cse11 (not .cse0)) (.cse17 (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#inc_flag~0.base|))) (and (or .cse0 (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse1 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (store (let ((.cse4 (store .cse5 |c_~#inc_flag~0.base| (store (select .cse5 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse3 (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse1 1)))) (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_6) |c_~#value~0.base| .cse3) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse4 |c_~#value~0.base| .cse3) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (= |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) (< (mod .cse1 4294967296) (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))))) (or (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse6 (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse7 (store (let ((.cse9 (store .cse10 |c_~#inc_flag~0.base| (store (select .cse10 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse8 (store (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse6 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse8) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383| (store (select (store .cse9 |c_~#value~0.base| .cse8) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_383|) 0)) (< (mod .cse6 4294967296) (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) .cse11) (or (forall ((v_ArrVal_108 (Array Int Int)) (|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_115 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (let ((.cse13 (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse12 (store (let ((.cse15 (store .cse16 |c_~#inc_flag~0.base| (store (select .cse16 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse14 (store (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse13 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse14) |c_~#inc_flag~0.base| (store (select (store .cse15 |c_~#value~0.base| .cse14) |c_~#inc_flag~0.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod .cse13 4294967296) (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select |c_#valid| |c_~#inc_flag~0.base|) 0))) (or (not .cse17) .cse18) (or .cse18 .cse11) (or .cse0 (forall ((|~#inc_flag~0.offset| Int) (v_ArrVal_110 Int) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse19 (store (let ((.cse22 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse24 |~#inc_flag~0.offset| v_ArrVal_110)))) (let ((.cse21 (store (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset| .cse23))) (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_6) |c_~#value~0.base| .cse21) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse22 |c_~#value~0.base| .cse21) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_115))) (or (not (= (mod (select (select .cse19 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse20 (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse17))))) is different from false [2023-11-17 15:10:36,691 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-11-17 15:10:38,734 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-11-17 15:10:41,360 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-11-17 15:10:44,243 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-11-17 15:10:47,852 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-11-17 15:10:51,321 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-11-17 15:10:59,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:02,273 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-11-17 15:11:04,519 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-11-17 15:11:13,744 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-11-17 15:11:15,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:17,819 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-11-17 15:11:19,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:21,557 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-11-17 15:11:24,684 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-11-17 15:11:26,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:44,821 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-11-17 15:11:47,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:50,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:55,707 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-11-17 15:11:57,721 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-11-17 15:12:01,921 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-11-17 15:12:03,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:05,950 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-11-17 15:12:08,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:14,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-11-17 15:12:17,258 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-11-17 15:12:20,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:24,110 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-11-17 15:12:46,670 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-11-17 15:12:49,491 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-11-17 15:12:51,605 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-11-17 15:13:11,955 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-11-17 15:13:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:13:20,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-11-17 15:13:23,050 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-11-17 15:13:26,519 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-11-17 15:13:28,664 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-11-17 15:13:30,710 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-11-17 15:13:33,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:13:37,594 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-11-17 15:13:39,649 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-11-17 15:13:42,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:13:51,169 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-11-17 15:13:53,368 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-11-17 15:13:55,921 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-11-17 15:13:58,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:00,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:03,033 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-11-17 15:14:06,159 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-11-17 15:14:08,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:10,246 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-11-17 15:14:12,258 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-11-17 15:14:14,652 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-11-17 15:14:16,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-11-17 15:14:18,782 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-11-17 15:14:20,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:23,434 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-11-17 15:14:25,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:28,270 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-11-17 15:14:33,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:38,697 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-11-17 15:14:41,320 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-11-17 15:14:43,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:47,176 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-11-17 15:15:00,477 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-11-17 15:15:05,014 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-11-17 15:15:08,209 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-11-17 15:15:21,086 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-11-17 15:15:23,307 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-11-17 15:15:26,326 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-11-17 15:15:28,412 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-11-17 15:15:28,412 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:15:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 15:15:28,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-11-17 15:15:28,747 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-11-17 15:15:28,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:15:28,938 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 135/436 universal loopers) in iteration 3,while PetriNetUnfolder was constructing finite prefix that currently has 28825 conditions, 8991 events (6357/8990 cut-off events. For 22910/22930 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 60679 event pairs, 884 based on Foata normal form. 285/9606 useless extension candidates. Maximal degree in co-relation 28812. Up to 4894 conditions per place.). [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-11-17 15:15:28,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-11-17 15:15:28,938 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-17 15:15:28,941 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-17 15:15:28,942 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:28,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:28 BasicIcfg [2023-11-17 15:15:28,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:28,951 INFO L158 Benchmark]: Toolchain (without parser) took 573651.12ms. Allocated memory was 257.9MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 202.4MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 883.2MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,951 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:28,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.18ms. Allocated memory is still 257.9MB. Free memory was 202.4MB in the beginning and 182.1MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 257.9MB. Free memory was 182.1MB in the beginning and 179.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,952 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 257.9MB. Free memory was 179.6MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,952 INFO L158 Benchmark]: RCFGBuilder took 586.15ms. Allocated memory is still 257.9MB. Free memory was 178.0MB in the beginning and 190.0MB in the end (delta: -12.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,952 INFO L158 Benchmark]: TraceAbstraction took 572636.14ms. Allocated memory was 257.9MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 189.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 869.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:28,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.18ms. Allocated memory is still 257.9MB. Free memory was 202.4MB in the beginning and 182.1MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 257.9MB. Free memory was 182.1MB in the beginning and 179.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 257.9MB. Free memory was 179.6MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 586.15ms. Allocated memory is still 257.9MB. Free memory was 178.0MB in the beginning and 190.0MB in the end (delta: -12.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * TraceAbstraction took 572636.14ms. Allocated memory was 257.9MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 189.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 869.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 91 PlacesBefore, 20 PlacesAfterwards, 98 TransitionsBefore, 24 TransitionsAfterwards, 1820 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 2241 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1814, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1250, independent: 1212, independent conditional: 0, independent unconditional: 1212, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1250, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 426, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 55, unknown conditional: 0, unknown unconditional: 55] ], Cache Queries: [ total: 1814, independent: 499, independent conditional: 0, independent unconditional: 499, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 1250, unknown conditional: 0, unknown unconditional: 1250] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.9s, 150 PlacesBefore, 43 PlacesAfterwards, 164 TransitionsBefore, 52 TransitionsAfterwards, 12220 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 5 ChoiceCompositions, 146 TotalNumberOfCompositions, 17473 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10270, independent: 10045, independent conditional: 0, independent unconditional: 10045, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8050, independent: 7952, independent conditional: 0, independent unconditional: 7952, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8050, independent: 7866, independent conditional: 0, independent unconditional: 7866, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 184, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12537, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 1504, dependent conditional: 0, dependent unconditional: 1504, unknown: 10938, unknown conditional: 0, unknown unconditional: 10938] ], Cache Queries: [ total: 10270, independent: 2093, independent conditional: 0, independent unconditional: 2093, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 8072, unknown conditional: 0, unknown unconditional: 8072] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.4s, 209 PlacesBefore, 61 PlacesAfterwards, 230 TransitionsBefore, 75 TransitionsAfterwards, 31200 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 130 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 7 ChoiceCompositions, 206 TotalNumberOfCompositions, 51490 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25684, independent: 25272, independent conditional: 0, independent unconditional: 25272, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20097, independent: 19940, independent conditional: 0, independent unconditional: 19940, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20097, independent: 19752, independent conditional: 0, independent unconditional: 19752, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 345, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2610, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 2473, dependent conditional: 0, dependent unconditional: 2473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25684, independent: 5332, independent conditional: 0, independent unconditional: 5332, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 20097, unknown conditional: 0, unknown unconditional: 20097] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 628, Positive conditional cache size: 0, Positive unconditional cache size: 628, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 708]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 135/436 universal loopers) in iteration 3,while PetriNetUnfolder was constructing finite prefix that currently has 28825 conditions, 8991 events (6357/8990 cut-off events. For 22910/22930 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 60679 event pairs, 884 based on Foata normal form. 285/9606 useless extension candidates. Maximal degree in co-relation 28812. Up to 4894 conditions per place.). - TimeoutResultAtElement [Line: 728]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 135/436 universal loopers) in iteration 3,while PetriNetUnfolder was constructing finite prefix that currently has 28825 conditions, 8991 events (6357/8990 cut-off events. For 22910/22930 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 60679 event pairs, 884 based on Foata normal form. 285/9606 useless extension candidates. Maximal degree in co-relation 28812. Up to 4894 conditions per place.). - TimeoutResultAtElement [Line: 755]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 135/436 universal loopers) in iteration 3,while PetriNetUnfolder was constructing finite prefix that currently has 28825 conditions, 8991 events (6357/8990 cut-off events. For 22910/22930 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 60679 event pairs, 884 based on Foata normal form. 285/9606 useless extension candidates. Maximal degree in co-relation 28812. Up to 4894 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 146 locations, 5 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: 4.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 203 locations, 7 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: 44.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 34.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=3, InterpolantAutomatonStates: 16, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 260 locations, 9 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: 523.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 436.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 72.4s, HoareTripleCheckerStatistics: 955 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 321.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 677 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 317.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1396 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2771 IncrementalHoareTripleChecker+Invalid, 5283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 0 mSDtfsCounter, 2771 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 114.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=2, InterpolantAutomatonStates: 10, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 13 QuantifiedInterpolants, 3694 SizeOfPredicates, 8 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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