/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:30:14,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:30:14,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:30:14,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:30:14,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:30:14,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:30:14,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:30:14,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:30:14,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:30:14,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:30:14,621 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:30:14,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:30:14,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:30:14,623 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:30:14,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:30:14,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:30:14,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:30:14,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:30:14,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:30:14,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:30:14,624 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:30:14,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:30:14,625 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:30:14,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:30:14,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:30:14,626 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:30:14,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:30:14,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:30:14,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:30:14,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:30:14,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:30:14,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:30:14,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:30:14,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:30:14,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:30:14,630 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:30:14,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:30:14,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:30:14,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:30:14,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:30:14,981 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:30:14,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-24 11:30:16,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:30:16,384 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:30:16,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-24 11:30:16,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e3d723c/828ee7de71424223b02403015486dde4/FLAG54dc46dc1 [2023-08-24 11:30:16,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e3d723c/828ee7de71424223b02403015486dde4 [2023-08-24 11:30:16,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:30:16,431 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:30:16,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:30:16,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:30:16,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:30:16,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:16,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4068596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16, skipping insertion in model container [2023-08-24 11:30:16,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:16,486 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:30:16,674 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 11:30:16,818 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/40_barrier_vf.i[31163,31176] [2023-08-24 11:30:16,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:30:16,835 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:30:16,853 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 11:30:16,863 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-24 11:30:16,865 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-24 11:30:16,882 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/40_barrier_vf.i[31163,31176] [2023-08-24 11:30:16,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:30:16,916 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:30:16,916 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:30:16,917 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:30:16,923 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:30:16,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16 WrapperNode [2023-08-24 11:30:16,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:30:16,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:30:16,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:30:16,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:30:16,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:16,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:16,987 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2023-08-24 11:30:16,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:30:16,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:30:16,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:30:16,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:30:16,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:16,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:30:17,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:30:17,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:30:17,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:30:17,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (1/1) ... [2023-08-24 11:30:17,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:30:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:17,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 11:30:17,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 11:30:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-24 11:30:17,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-24 11:30:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:30:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:30:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:30:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:30:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:30:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:30:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:30:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:30:17,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:30:17,105 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:30:17,242 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:30:17,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:30:17,422 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:30:17,477 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:30:17,477 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-24 11:30:17,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:30:17 BoogieIcfgContainer [2023-08-24 11:30:17,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:30:17,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:30:17,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:30:17,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:30:17,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:30:16" (1/3) ... [2023-08-24 11:30:17,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7494e0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:30:17, skipping insertion in model container [2023-08-24 11:30:17,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:30:16" (2/3) ... [2023-08-24 11:30:17,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7494e0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:30:17, skipping insertion in model container [2023-08-24 11:30:17,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:30:17" (3/3) ... [2023-08-24 11:30:17,486 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-08-24 11:30:17,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:30:17,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 11:30:17,503 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:30:17,559 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:30:17,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,630 INFO L124 PetriNetUnfolderBase]: 4/59 cut-off events. [2023-08-24 11:30:17,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:17,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-24 11:30:17,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,639 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:30:17,647 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,649 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:17,662 INFO L124 PetriNetUnfolderBase]: 4/59 cut-off events. [2023-08-24 11:30:17,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:17,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-24 11:30:17,663 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-24 11:30:19,775 INFO L134 LiptonReduction]: Checked pairs total: 520 [2023-08-24 11:30:19,775 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-08-24 11:30:19,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:30:19,793 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eb137f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:30:19,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-24 11:30:19,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:30:19,796 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-24 11:30:19,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:19,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:19,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 11:30:19,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:19,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 9504075, now seen corresponding path program 1 times [2023-08-24 11:30:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571450798] [2023-08-24 11:30:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:30:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571450798] [2023-08-24 11:30:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571450798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:20,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:20,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:30:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312805523] [2023-08-24 11:30:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:30:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:30:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:30:20,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 99 [2023-08-24 11:30:20,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:20,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:20,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 99 [2023-08-24 11:30:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:20,190 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-24 11:30:20,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:20,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-24 11:30:20,191 INFO L140 encePairwiseOnDemand]: 95/99 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-24 11:30:20,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 5 transitions, 23 flow [2023-08-24 11:30:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:30:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:30:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-08-24 11:30:20,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164983164983165 [2023-08-24 11:30:20,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-08-24 11:30:20,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-08-24 11:30:20,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:20,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-08-24 11:30:20,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:20,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:20,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:20,221 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 21 flow. Second operand 3 states and 94 transitions. [2023-08-24 11:30:20,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 5 transitions, 23 flow [2023-08-24 11:30:20,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 5 transitions, 23 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:30:20,224 INFO L231 Difference]: Finished difference. Result has 10 places, 0 transitions, 0 flow [2023-08-24 11:30:20,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=15, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=10, PETRI_TRANSITIONS=0} [2023-08-24 11:30:20,231 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-08-24 11:30:20,231 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 0 transitions, 0 flow [2023-08-24 11:30:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:20,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-24 11:30:20,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-24 11:30:20,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:30:20,234 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:30:20,238 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-24 11:30:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,264 INFO L124 PetriNetUnfolderBase]: 4/59 cut-off events. [2023-08-24 11:30:20,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:20,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-24 11:30:20,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,265 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:30:20,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,266 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-24 11:30:20,273 INFO L124 PetriNetUnfolderBase]: 4/59 cut-off events. [2023-08-24 11:30:20,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:20,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-24 11:30:20,274 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-24 11:30:21,970 INFO L134 LiptonReduction]: Checked pairs total: 522 [2023-08-24 11:30:21,971 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-08-24 11:30:21,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:30:21,979 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eb137f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:30:21,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:30:21,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:30:21,985 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-08-24 11:30:21,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:30:21,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:21,986 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-24 11:30:21,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:30:21,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1991582203, now seen corresponding path program 1 times [2023-08-24 11:30:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:21,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385557705] [2023-08-24 11:30:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:22,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:30:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:22,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:30:22,021 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:30:22,021 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:30:22,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:30:22,021 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:30:22,022 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:30:22,022 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:30:22,022 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 11:30:22,036 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:30:22,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,050 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2023-08-24 11:30:22,050 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:22,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-24 11:30:22,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,052 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:30:22,052 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,052 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:22,063 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2023-08-24 11:30:22,064 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:22,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-24 11:30:22,066 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-08-24 11:30:22,828 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-08-24 11:30:22,829 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-08-24 11:30:22,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:30:22,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eb137f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:30:22,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 11:30:22,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:30:22,836 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-08-24 11:30:22,836 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:22,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:22,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:22,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:22,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1878992399, now seen corresponding path program 1 times [2023-08-24 11:30:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917782007] [2023-08-24 11:30:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:30:22,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:22,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917782007] [2023-08-24 11:30:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917782007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:22,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:30:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139327148] [2023-08-24 11:30:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:22,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:30:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:30:22,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:30:22,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 119 [2023-08-24 11:30:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:22,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 119 [2023-08-24 11:30:22,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:23,216 INFO L124 PetriNetUnfolderBase]: 689/1293 cut-off events. [2023-08-24 11:30:23,217 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-24 11:30:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 1293 events. 689/1293 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8294 event pairs, 99 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 2262. Up to 457 conditions per place. [2023-08-24 11:30:23,225 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 77 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-08-24 11:30:23,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 102 transitions, 421 flow [2023-08-24 11:30:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:30:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:30:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 389 transitions. [2023-08-24 11:30:23,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669867947178872 [2023-08-24 11:30:23,235 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 389 transitions. [2023-08-24 11:30:23,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 389 transitions. [2023-08-24 11:30:23,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:23,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 389 transitions. [2023-08-24 11:30:23,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.57142857142857) internal successors, (389), 7 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,244 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,244 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 7 states and 389 transitions. [2023-08-24 11:30:23,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 102 transitions, 421 flow [2023-08-24 11:30:23,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 419 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-24 11:30:23,248 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 208 flow [2023-08-24 11:30:23,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2023-08-24 11:30:23,250 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-24 11:30:23,251 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 208 flow [2023-08-24 11:30:23,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:23,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:30:23,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:23,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -908360492, now seen corresponding path program 1 times [2023-08-24 11:30:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:23,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557156584] [2023-08-24 11:30:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:30:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557156584] [2023-08-24 11:30:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557156584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:30:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524427017] [2023-08-24 11:30:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:23,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:30:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:23,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:30:23,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:30:23,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 119 [2023-08-24 11:30:23,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:23,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 119 [2023-08-24 11:30:23,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:23,516 INFO L124 PetriNetUnfolderBase]: 416/837 cut-off events. [2023-08-24 11:30:23,517 INFO L125 PetriNetUnfolderBase]: For 432/460 co-relation queries the response was YES. [2023-08-24 11:30:23,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 837 events. 416/837 cut-off events. For 432/460 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5036 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1528. Up to 395 conditions per place. [2023-08-24 11:30:23,522 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-24 11:30:23,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 362 flow [2023-08-24 11:30:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:30:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:30:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-08-24 11:30:23,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070028011204482 [2023-08-24 11:30:23,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2023-08-24 11:30:23,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2023-08-24 11:30:23,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:23,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2023-08-24 11:30:23,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,526 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 208 flow. Second operand 3 states and 181 transitions. [2023-08-24 11:30:23,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 362 flow [2023-08-24 11:30:23,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:30:23,530 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 235 flow [2023-08-24 11:30:23,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-24 11:30:23,531 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-24 11:30:23,531 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 235 flow [2023-08-24 11:30:23,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:23,532 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:23,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:30:23,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:23,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1481656299, now seen corresponding path program 1 times [2023-08-24 11:30:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:23,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293476164] [2023-08-24 11:30:23,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293476164] [2023-08-24 11:30:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293476164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:30:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466529028] [2023-08-24 11:30:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:23,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:30:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:30:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:30:23,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 119 [2023-08-24 11:30:23,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:23,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 119 [2023-08-24 11:30:23,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:23,752 INFO L124 PetriNetUnfolderBase]: 348/673 cut-off events. [2023-08-24 11:30:23,753 INFO L125 PetriNetUnfolderBase]: For 420/426 co-relation queries the response was YES. [2023-08-24 11:30:23,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 673 events. 348/673 cut-off events. For 420/426 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3688 event pairs, 105 based on Foata normal form. 14/672 useless extension candidates. Maximal degree in co-relation 1254. Up to 291 conditions per place. [2023-08-24 11:30:23,757 INFO L140 encePairwiseOnDemand]: 110/119 looper letters, 59 selfloop transitions, 14 changer transitions 12/94 dead transitions. [2023-08-24 11:30:23,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 542 flow [2023-08-24 11:30:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:30:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:30:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 350 transitions. [2023-08-24 11:30:23,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2023-08-24 11:30:23,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 350 transitions. [2023-08-24 11:30:23,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 350 transitions. [2023-08-24 11:30:23,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:23,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 350 transitions. [2023-08-24 11:30:23,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,762 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,762 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 235 flow. Second operand 7 states and 350 transitions. [2023-08-24 11:30:23,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 542 flow [2023-08-24 11:30:23,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:30:23,767 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 290 flow [2023-08-24 11:30:23,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-24 11:30:23,767 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-08-24 11:30:23,768 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 290 flow [2023-08-24 11:30:23,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:23,768 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:23,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:30:23,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:23,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash -25820515, now seen corresponding path program 1 times [2023-08-24 11:30:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634659706] [2023-08-24 11:30:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634659706] [2023-08-24 11:30:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634659706] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940724020] [2023-08-24 11:30:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:23,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:23,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 11:30:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:23,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-24 11:30:23,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:23,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:30:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940724020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:30:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-24 11:30:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615780250] [2023-08-24 11:30:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:23,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:30:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:30:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:30:23,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-08-24 11:30:23,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:23,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:23,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-08-24 11:30:23,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:24,054 INFO L124 PetriNetUnfolderBase]: 59/173 cut-off events. [2023-08-24 11:30:24,054 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-08-24 11:30:24,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 173 events. 59/173 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 673 event pairs, 21 based on Foata normal form. 12/182 useless extension candidates. Maximal degree in co-relation 344. Up to 74 conditions per place. [2023-08-24 11:30:24,055 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 18 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2023-08-24 11:30:24,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 266 flow [2023-08-24 11:30:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:30:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:30:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2023-08-24 11:30:24,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-08-24 11:30:24,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 183 transitions. [2023-08-24 11:30:24,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 183 transitions. [2023-08-24 11:30:24,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:24,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 183 transitions. [2023-08-24 11:30:24,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,060 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 290 flow. Second operand 3 states and 183 transitions. [2023-08-24 11:30:24,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 266 flow [2023-08-24 11:30:24,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 232 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-24 11:30:24,062 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 163 flow [2023-08-24 11:30:24,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-24 11:30:24,064 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-24 11:30:24,064 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 163 flow [2023-08-24 11:30:24,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:24,064 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:24,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 11:30:24,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 11:30:24,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:24,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash 361947616, now seen corresponding path program 1 times [2023-08-24 11:30:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075088924] [2023-08-24 11:30:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075088924] [2023-08-24 11:30:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075088924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327946092] [2023-08-24 11:30:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:24,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:24,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:24,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 11:30:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:24,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-24 11:30:24,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:24,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:30:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327946092] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:30:24,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:30:24,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 11:30:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496445476] [2023-08-24 11:30:24,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:30:24,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 11:30:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:24,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 11:30:24,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-24 11:30:24,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-08-24 11:30:24,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 163 flow. Second operand has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:24,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-08-24 11:30:24,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:24,861 INFO L124 PetriNetUnfolderBase]: 52/140 cut-off events. [2023-08-24 11:30:24,862 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-24 11:30:24,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 140 events. 52/140 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 502 event pairs, 22 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 228. Up to 64 conditions per place. [2023-08-24 11:30:24,863 INFO L140 encePairwiseOnDemand]: 109/119 looper letters, 19 selfloop transitions, 7 changer transitions 16/47 dead transitions. [2023-08-24 11:30:24,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 274 flow [2023-08-24 11:30:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 11:30:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 11:30:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 487 transitions. [2023-08-24 11:30:24,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34103641456582634 [2023-08-24 11:30:24,865 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 487 transitions. [2023-08-24 11:30:24,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 487 transitions. [2023-08-24 11:30:24,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:24,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 487 transitions. [2023-08-24 11:30:24,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 40.583333333333336) internal successors, (487), 12 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,869 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,870 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 163 flow. Second operand 12 states and 487 transitions. [2023-08-24 11:30:24,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 274 flow [2023-08-24 11:30:24,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 252 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-24 11:30:24,871 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 105 flow [2023-08-24 11:30:24,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=105, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2023-08-24 11:30:24,872 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-24 11:30:24,872 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 105 flow [2023-08-24 11:30:24,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:24,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:24,873 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:24,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 11:30:25,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 11:30:25,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:25,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1052392163, now seen corresponding path program 1 times [2023-08-24 11:30:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759552907] [2023-08-24 11:30:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759552907] [2023-08-24 11:30:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759552907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:25,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:30:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004562878] [2023-08-24 11:30:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:25,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:30:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:30:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:30:25,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-08-24 11:30:25,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:25,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:25,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-08-24 11:30:25,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:25,278 INFO L124 PetriNetUnfolderBase]: 11/45 cut-off events. [2023-08-24 11:30:25,278 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 11:30:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 45 events. 11/45 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 115. Up to 16 conditions per place. [2023-08-24 11:30:25,279 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-24 11:30:25,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 21 transitions, 117 flow [2023-08-24 11:30:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:30:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:30:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 315 transitions. [2023-08-24 11:30:25,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2023-08-24 11:30:25,281 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 315 transitions. [2023-08-24 11:30:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 315 transitions. [2023-08-24 11:30:25,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:25,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 315 transitions. [2023-08-24 11:30:25,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.375) internal successors, (315), 8 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:25,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:25,285 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:25,285 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 105 flow. Second operand 8 states and 315 transitions. [2023-08-24 11:30:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 21 transitions, 117 flow [2023-08-24 11:30:25,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-24 11:30:25,286 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2023-08-24 11:30:25,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2023-08-24 11:30:25,287 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2023-08-24 11:30:25,288 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 0 transitions, 0 flow [2023-08-24 11:30:25,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:25,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 11:30:25,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-24 11:30:25,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-24 11:30:25,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:30:25,289 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-24 11:30:25,290 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-24 11:30:25,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,301 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2023-08-24 11:30:25,301 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:25,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-24 11:30:25,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,303 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:30:25,303 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,303 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-24 11:30:25,309 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2023-08-24 11:30:25,309 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:25,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-24 11:30:25,311 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-08-24 11:30:26,064 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-08-24 11:30:26,064 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-08-24 11:30:26,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:30:26,066 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eb137f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:30:26,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:30:26,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:30:26,068 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-08-24 11:30:26,068 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:30:26,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:26,069 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-24 11:30:26,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:30:26,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash -287549659, now seen corresponding path program 1 times [2023-08-24 11:30:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:26,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665245759] [2023-08-24 11:30:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:26,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:30:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:26,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:30:26,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:30:26,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:30:26,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:30:26,100 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:30:26,101 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:30:26,101 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:30:26,101 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-24 11:30:26,121 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:30:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,131 INFO L124 PetriNetUnfolderBase]: 10/129 cut-off events. [2023-08-24 11:30:26,131 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:30:26,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-08-24 11:30:26,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,132 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:30:26,133 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,133 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-08-24 11:30:26,141 INFO L124 PetriNetUnfolderBase]: 10/129 cut-off events. [2023-08-24 11:30:26,141 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:30:26,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-08-24 11:30:26,144 INFO L119 LiptonReduction]: Number of co-enabled transitions 4752 [2023-08-24 11:30:26,986 INFO L134 LiptonReduction]: Checked pairs total: 20874 [2023-08-24 11:30:26,986 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-24 11:30:26,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:30:26,988 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eb137f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:30:26,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:30:26,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:30:26,990 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-08-24 11:30:26,990 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 11:30:26,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:26,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:26,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:26,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -799850224, now seen corresponding path program 1 times [2023-08-24 11:30:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:26,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457962974] [2023-08-24 11:30:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:30:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457962974] [2023-08-24 11:30:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457962974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:27,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:27,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:30:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102108426] [2023-08-24 11:30:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:27,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:30:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:30:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:30:27,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-08-24 11:30:27,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:27,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:27,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-08-24 11:30:27,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:28,818 INFO L124 PetriNetUnfolderBase]: 15991/24374 cut-off events. [2023-08-24 11:30:28,818 INFO L125 PetriNetUnfolderBase]: For 1543/1543 co-relation queries the response was YES. [2023-08-24 11:30:28,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48417 conditions, 24374 events. 15991/24374 cut-off events. For 1543/1543 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 185289 event pairs, 2849 based on Foata normal form. 0/23213 useless extension candidates. Maximal degree in co-relation 26312. Up to 9503 conditions per place. [2023-08-24 11:30:28,977 INFO L140 encePairwiseOnDemand]: 138/154 looper letters, 148 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2023-08-24 11:30:28,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 183 transitions, 785 flow [2023-08-24 11:30:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:30:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:30:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 542 transitions. [2023-08-24 11:30:28,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027829313543599 [2023-08-24 11:30:28,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 542 transitions. [2023-08-24 11:30:28,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 542 transitions. [2023-08-24 11:30:28,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:28,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 542 transitions. [2023-08-24 11:30:28,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.42857142857143) internal successors, (542), 7 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:28,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:28,985 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:28,985 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 123 flow. Second operand 7 states and 542 transitions. [2023-08-24 11:30:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 183 transitions, 785 flow [2023-08-24 11:30:28,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 183 transitions, 769 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-24 11:30:28,989 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 323 flow [2023-08-24 11:30:28,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2023-08-24 11:30:28,991 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-08-24 11:30:28,991 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 323 flow [2023-08-24 11:30:28,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:28,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:28,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:30:28,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:28,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1060129555, now seen corresponding path program 1 times [2023-08-24 11:30:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400884794] [2023-08-24 11:30:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:30:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400884794] [2023-08-24 11:30:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400884794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:29,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:30:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113034574] [2023-08-24 11:30:29,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:29,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:30:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:30:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:30:29,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 154 [2023-08-24 11:30:29,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:29,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:29,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 154 [2023-08-24 11:30:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:30,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,093 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,093 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,093 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,093 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,101 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,101 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,101 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,103 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,137 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,137 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,137 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,137 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,138 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,138 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,138 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,139 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:30:30,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,239 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,325 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,325 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,325 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,331 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,331 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,332 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,332 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,360 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,360 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,360 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,360 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,360 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,361 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,361 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,361 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,370 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,370 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,370 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,371 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 11:30:30,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,436 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,436 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,436 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,436 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 34#L733-4true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,436 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,437 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,437 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,437 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,487 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,487 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,487 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,488 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:30:30,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,544 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 17#L724-5true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,544 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,544 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 34#L733-4true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,556 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,556 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,557 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,557 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,596 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,596 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:30:30,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,651 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,651 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,651 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,651 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,651 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,652 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,652 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,652 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,660 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,660 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,662 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,662 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,662 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,662 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,662 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,662 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:30:30,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 39#L725true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,726 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,726 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,727 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,727 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:30:30,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,772 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,772 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,772 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,772 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= 0 ~COND~0) (<= ~COND~0 (* 256 (div ~COND~0 256)))), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-24 11:30:30,772 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,773 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,773 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,773 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:30:30,928 INFO L124 PetriNetUnfolderBase]: 13836/21473 cut-off events. [2023-08-24 11:30:30,928 INFO L125 PetriNetUnfolderBase]: For 12855/14317 co-relation queries the response was YES. [2023-08-24 11:30:30,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50628 conditions, 21473 events. 13836/21473 cut-off events. For 12855/14317 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 167877 event pairs, 5116 based on Foata normal form. 1145/21851 useless extension candidates. Maximal degree in co-relation 38841. Up to 9908 conditions per place. [2023-08-24 11:30:31,082 INFO L140 encePairwiseOnDemand]: 144/154 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-24 11:30:31,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 624 flow [2023-08-24 11:30:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:30:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:30:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-08-24 11:30:31,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-24 11:30:31,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-08-24 11:30:31,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-08-24 11:30:31,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:31,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-08-24 11:30:31,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:31,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:31,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:31,086 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 323 flow. Second operand 3 states and 242 transitions. [2023-08-24 11:30:31,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 624 flow [2023-08-24 11:30:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:30:31,114 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 381 flow [2023-08-24 11:30:31,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-08-24 11:30:31,115 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-24 11:30:31,115 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 381 flow [2023-08-24 11:30:31,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:31,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:31,115 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:31,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:30:31,115 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:31,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 420780807, now seen corresponding path program 1 times [2023-08-24 11:30:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488069481] [2023-08-24 11:30:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488069481] [2023-08-24 11:30:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488069481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:30:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781081884] [2023-08-24 11:30:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:31,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:30:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:30:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:30:31,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-08-24 11:30:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:31,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-08-24 11:30:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:33,154 INFO L124 PetriNetUnfolderBase]: 18101/28276 cut-off events. [2023-08-24 11:30:33,155 INFO L125 PetriNetUnfolderBase]: For 20533/20813 co-relation queries the response was YES. [2023-08-24 11:30:33,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73026 conditions, 28276 events. 18101/28276 cut-off events. For 20533/20813 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 227398 event pairs, 4583 based on Foata normal form. 556/28371 useless extension candidates. Maximal degree in co-relation 43551. Up to 11838 conditions per place. [2023-08-24 11:30:33,323 INFO L140 encePairwiseOnDemand]: 143/154 looper letters, 149 selfloop transitions, 39 changer transitions 0/203 dead transitions. [2023-08-24 11:30:33,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 203 transitions, 1188 flow [2023-08-24 11:30:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:30:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:30:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2023-08-24 11:30:33,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2023-08-24 11:30:33,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 438 transitions. [2023-08-24 11:30:33,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 438 transitions. [2023-08-24 11:30:33,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:33,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 438 transitions. [2023-08-24 11:30:33,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:33,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:33,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:33,329 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 381 flow. Second operand 6 states and 438 transitions. [2023-08-24 11:30:33,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 203 transitions, 1188 flow [2023-08-24 11:30:33,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 203 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:30:33,405 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 641 flow [2023-08-24 11:30:33,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2023-08-24 11:30:33,406 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2023-08-24 11:30:33,406 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 106 transitions, 641 flow [2023-08-24 11:30:33,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:33,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:33,407 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:33,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:30:33,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:33,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1151192071, now seen corresponding path program 1 times [2023-08-24 11:30:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906666562] [2023-08-24 11:30:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906666562] [2023-08-24 11:30:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906666562] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259201108] [2023-08-24 11:30:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:33,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:33,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 11:30:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:33,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-24 11:30:33,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:33,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:30:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259201108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:30:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-24 11:30:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578929743] [2023-08-24 11:30:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:30:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:30:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:30:33,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 154 [2023-08-24 11:30:33,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 106 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:33,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:33,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 154 [2023-08-24 11:30:33,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:33,979 INFO L124 PetriNetUnfolderBase]: 2059/4191 cut-off events. [2023-08-24 11:30:33,979 INFO L125 PetriNetUnfolderBase]: For 2163/2171 co-relation queries the response was YES. [2023-08-24 11:30:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 4191 events. 2059/4191 cut-off events. For 2163/2171 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33534 event pairs, 831 based on Foata normal form. 354/4494 useless extension candidates. Maximal degree in co-relation 7431. Up to 1784 conditions per place. [2023-08-24 11:30:34,000 INFO L140 encePairwiseOnDemand]: 142/154 looper letters, 28 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-08-24 11:30:34,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 415 flow [2023-08-24 11:30:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:30:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:30:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-24 11:30:34,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-24 11:30:34,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-24 11:30:34,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-24 11:30:34,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:34,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-24 11:30:34,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,008 INFO L175 Difference]: Start difference. First operand has 73 places, 106 transitions, 641 flow. Second operand 3 states and 238 transitions. [2023-08-24 11:30:34,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 415 flow [2023-08-24 11:30:34,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 360 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-08-24 11:30:34,015 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 270 flow [2023-08-24 11:30:34,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-08-24 11:30:34,016 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-24 11:30:34,016 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 270 flow [2023-08-24 11:30:34,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:34,016 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 11:30:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:34,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:34,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -841570106, now seen corresponding path program 1 times [2023-08-24 11:30:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:34,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61319084] [2023-08-24 11:30:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:30:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:34,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61319084] [2023-08-24 11:30:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61319084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:34,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:30:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752956354] [2023-08-24 11:30:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:34,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:30:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:30:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:30:34,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 154 [2023-08-24 11:30:34,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:34,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 154 [2023-08-24 11:30:34,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:34,594 INFO L124 PetriNetUnfolderBase]: 1891/3540 cut-off events. [2023-08-24 11:30:34,594 INFO L125 PetriNetUnfolderBase]: For 1353/1381 co-relation queries the response was YES. [2023-08-24 11:30:34,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9051 conditions, 3540 events. 1891/3540 cut-off events. For 1353/1381 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25782 event pairs, 671 based on Foata normal form. 4/3522 useless extension candidates. Maximal degree in co-relation 4728. Up to 1381 conditions per place. [2023-08-24 11:30:34,608 INFO L140 encePairwiseOnDemand]: 144/154 looper letters, 87 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2023-08-24 11:30:34,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 630 flow [2023-08-24 11:30:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:30:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:30:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 382 transitions. [2023-08-24 11:30:34,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2023-08-24 11:30:34,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 382 transitions. [2023-08-24 11:30:34,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 382 transitions. [2023-08-24 11:30:34,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:34,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 382 transitions. [2023-08-24 11:30:34,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,614 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,614 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 270 flow. Second operand 6 states and 382 transitions. [2023-08-24 11:30:34,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 630 flow [2023-08-24 11:30:34,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 600 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:30:34,620 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 304 flow [2023-08-24 11:30:34,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-08-24 11:30:34,620 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2023-08-24 11:30:34,620 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 304 flow [2023-08-24 11:30:34,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:34,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:34,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:34,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:30:34,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:34,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 601777900, now seen corresponding path program 1 times [2023-08-24 11:30:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775752231] [2023-08-24 11:30:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:34,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775752231] [2023-08-24 11:30:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775752231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967134635] [2023-08-24 11:30:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:34,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:34,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 11:30:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:34,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-24 11:30:34,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:34,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:30:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:30:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967134635] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:30:34,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:30:34,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 11:30:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783342553] [2023-08-24 11:30:34,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:30:35,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 11:30:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:35,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 11:30:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-24 11:30:35,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:35,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 48.38461538461539) internal successors, (629), 13 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:35,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:35,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:35,550 INFO L124 PetriNetUnfolderBase]: 1692/3147 cut-off events. [2023-08-24 11:30:35,550 INFO L125 PetriNetUnfolderBase]: For 1636/1648 co-relation queries the response was YES. [2023-08-24 11:30:35,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 3147 events. 1692/3147 cut-off events. For 1636/1648 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22488 event pairs, 524 based on Foata normal form. 8/3136 useless extension candidates. Maximal degree in co-relation 5087. Up to 1088 conditions per place. [2023-08-24 11:30:35,564 INFO L140 encePairwiseOnDemand]: 139/154 looper letters, 101 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2023-08-24 11:30:35,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 141 transitions, 838 flow [2023-08-24 11:30:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 11:30:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 11:30:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2023-08-24 11:30:35,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724911452184179 [2023-08-24 11:30:35,574 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 631 transitions. [2023-08-24 11:30:35,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 631 transitions. [2023-08-24 11:30:35,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:35,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 631 transitions. [2023-08-24 11:30:35,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 57.36363636363637) internal successors, (631), 11 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,581 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,582 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 304 flow. Second operand 11 states and 631 transitions. [2023-08-24 11:30:35,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 141 transitions, 838 flow [2023-08-24 11:30:35,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 824 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 11:30:35,590 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 383 flow [2023-08-24 11:30:35,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2023-08-24 11:30:35,591 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-24 11:30:35,591 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 383 flow [2023-08-24 11:30:35,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.38461538461539) internal successors, (629), 13 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:35,593 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:35,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 11:30:35,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 11:30:35,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:35,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash 801734806, now seen corresponding path program 1 times [2023-08-24 11:30:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042106260] [2023-08-24 11:30:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042106260] [2023-08-24 11:30:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042106260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:35,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:30:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049533495] [2023-08-24 11:30:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:35,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:30:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:30:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:30:35,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:35,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:35,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:35,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:35,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:36,189 INFO L124 PetriNetUnfolderBase]: 1378/2592 cut-off events. [2023-08-24 11:30:36,189 INFO L125 PetriNetUnfolderBase]: For 1686/1702 co-relation queries the response was YES. [2023-08-24 11:30:36,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 2592 events. 1378/2592 cut-off events. For 1686/1702 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17846 event pairs, 477 based on Foata normal form. 10/2586 useless extension candidates. Maximal degree in co-relation 4087. Up to 971 conditions per place. [2023-08-24 11:30:36,201 INFO L140 encePairwiseOnDemand]: 143/154 looper letters, 96 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2023-08-24 11:30:36,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 121 transitions, 793 flow [2023-08-24 11:30:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:30:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:30:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 470 transitions. [2023-08-24 11:30:36,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814935064935065 [2023-08-24 11:30:36,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 470 transitions. [2023-08-24 11:30:36,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 470 transitions. [2023-08-24 11:30:36,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:36,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 470 transitions. [2023-08-24 11:30:36,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 58.75) internal successors, (470), 8 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:36,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:36,210 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:36,210 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 383 flow. Second operand 8 states and 470 transitions. [2023-08-24 11:30:36,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 121 transitions, 793 flow [2023-08-24 11:30:36,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 734 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-24 11:30:36,216 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 372 flow [2023-08-24 11:30:36,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-08-24 11:30:36,216 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-24 11:30:36,216 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 372 flow [2023-08-24 11:30:36,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:36,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:36,217 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:36,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:30:36,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:36,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 346429423, now seen corresponding path program 1 times [2023-08-24 11:30:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499968705] [2023-08-24 11:30:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499968705] [2023-08-24 11:30:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499968705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189052449] [2023-08-24 11:30:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:36,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:36,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:36,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:36,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 11:30:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:36,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-24 11:30:36,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:36,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:30:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:30:36,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189052449] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:30:36,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:30:36,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 11:30:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570294238] [2023-08-24 11:30:36,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:30:36,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 11:30:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:36,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 11:30:36,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-24 11:30:36,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:36,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 372 flow. Second operand has 13 states, 13 states have (on average 48.69230769230769) internal successors, (633), 13 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:36,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:36,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:36,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:37,103 INFO L124 PetriNetUnfolderBase]: 1199/2273 cut-off events. [2023-08-24 11:30:37,104 INFO L125 PetriNetUnfolderBase]: For 1134/1150 co-relation queries the response was YES. [2023-08-24 11:30:37,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2273 events. 1199/2273 cut-off events. For 1134/1150 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15333 event pairs, 412 based on Foata normal form. 6/2258 useless extension candidates. Maximal degree in co-relation 4191. Up to 880 conditions per place. [2023-08-24 11:30:37,118 INFO L140 encePairwiseOnDemand]: 139/154 looper letters, 91 selfloop transitions, 32 changer transitions 0/135 dead transitions. [2023-08-24 11:30:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 135 transitions, 850 flow [2023-08-24 11:30:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 11:30:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 11:30:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 714 transitions. [2023-08-24 11:30:37,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35664335664335667 [2023-08-24 11:30:37,122 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 714 transitions. [2023-08-24 11:30:37,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 714 transitions. [2023-08-24 11:30:37,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:37,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 714 transitions. [2023-08-24 11:30:37,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 54.92307692307692) internal successors, (714), 13 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:37,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:37,127 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:37,127 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 372 flow. Second operand 13 states and 714 transitions. [2023-08-24 11:30:37,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 135 transitions, 850 flow [2023-08-24 11:30:37,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 135 transitions, 826 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 11:30:37,134 INFO L231 Difference]: Finished difference. Result has 94 places, 72 transitions, 435 flow [2023-08-24 11:30:37,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=435, PETRI_PLACES=94, PETRI_TRANSITIONS=72} [2023-08-24 11:30:37,134 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2023-08-24 11:30:37,134 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 72 transitions, 435 flow [2023-08-24 11:30:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.69230769230769) internal successors, (633), 13 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:37,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:37,135 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:37,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 11:30:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 11:30:37,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:37,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1846406849, now seen corresponding path program 1 times [2023-08-24 11:30:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108289585] [2023-08-24 11:30:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:30:37,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108289585] [2023-08-24 11:30:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108289585] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:30:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769912370] [2023-08-24 11:30:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:37,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:30:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:30:37,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:30:37,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 11:30:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:37,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-24 11:30:37,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:30:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:30:37,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:30:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:30:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769912370] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:30:37,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:30:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 11:30:37,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041516649] [2023-08-24 11:30:37,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:30:37,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 11:30:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 11:30:37,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-24 11:30:37,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:37,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 72 transitions, 435 flow. Second operand has 13 states, 13 states have (on average 48.53846153846154) internal successors, (631), 13 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:37,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:38,160 INFO L124 PetriNetUnfolderBase]: 1032/1974 cut-off events. [2023-08-24 11:30:38,161 INFO L125 PetriNetUnfolderBase]: For 1100/1116 co-relation queries the response was YES. [2023-08-24 11:30:38,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1974 events. 1032/1974 cut-off events. For 1100/1116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12939 event pairs, 392 based on Foata normal form. 6/1960 useless extension candidates. Maximal degree in co-relation 3572. Up to 828 conditions per place. [2023-08-24 11:30:38,172 INFO L140 encePairwiseOnDemand]: 139/154 looper letters, 82 selfloop transitions, 33 changer transitions 1/128 dead transitions. [2023-08-24 11:30:38,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 128 transitions, 871 flow [2023-08-24 11:30:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 11:30:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 11:30:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 657 transitions. [2023-08-24 11:30:38,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3555194805194805 [2023-08-24 11:30:38,175 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 657 transitions. [2023-08-24 11:30:38,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 657 transitions. [2023-08-24 11:30:38,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:38,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 657 transitions. [2023-08-24 11:30:38,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 54.75) internal successors, (657), 12 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 154.0) internal successors, (2002), 13 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,179 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 154.0) internal successors, (2002), 13 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,179 INFO L175 Difference]: Start difference. First operand has 94 places, 72 transitions, 435 flow. Second operand 12 states and 657 transitions. [2023-08-24 11:30:38,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 128 transitions, 871 flow [2023-08-24 11:30:38,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 128 transitions, 836 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-24 11:30:38,186 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 520 flow [2023-08-24 11:30:38,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=520, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2023-08-24 11:30:38,187 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2023-08-24 11:30:38,187 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 520 flow [2023-08-24 11:30:38,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.53846153846154) internal successors, (631), 13 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:38,187 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:38,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 11:30:38,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 11:30:38,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:38,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2059458919, now seen corresponding path program 1 times [2023-08-24 11:30:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066066127] [2023-08-24 11:30:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:30:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066066127] [2023-08-24 11:30:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066066127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:30:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358138565] [2023-08-24 11:30:38,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:30:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:30:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:30:38,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:38,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:38,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:38,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:38,804 INFO L124 PetriNetUnfolderBase]: 755/1478 cut-off events. [2023-08-24 11:30:38,804 INFO L125 PetriNetUnfolderBase]: For 1304/1312 co-relation queries the response was YES. [2023-08-24 11:30:38,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1478 events. 755/1478 cut-off events. For 1304/1312 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9144 event pairs, 349 based on Foata normal form. 4/1464 useless extension candidates. Maximal degree in co-relation 2420. Up to 747 conditions per place. [2023-08-24 11:30:38,813 INFO L140 encePairwiseOnDemand]: 143/154 looper letters, 79 selfloop transitions, 13 changer transitions 1/105 dead transitions. [2023-08-24 11:30:38,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 814 flow [2023-08-24 11:30:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:30:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:30:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 447 transitions. [2023-08-24 11:30:38,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3628246753246753 [2023-08-24 11:30:38,816 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 447 transitions. [2023-08-24 11:30:38,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 447 transitions. [2023-08-24 11:30:38,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:38,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 447 transitions. [2023-08-24 11:30:38,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 55.875) internal successors, (447), 8 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,820 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,820 INFO L175 Difference]: Start difference. First operand has 100 places, 75 transitions, 520 flow. Second operand 8 states and 447 transitions. [2023-08-24 11:30:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 814 flow [2023-08-24 11:30:38,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 789 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 11:30:38,828 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 536 flow [2023-08-24 11:30:38,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2023-08-24 11:30:38,829 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2023-08-24 11:30:38,829 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 536 flow [2023-08-24 11:30:38,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:38,829 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 11:30:38,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:38,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1668575763, now seen corresponding path program 1 times [2023-08-24 11:30:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306013945] [2023-08-24 11:30:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:30:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:30:38,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:30:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306013945] [2023-08-24 11:30:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306013945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:30:38,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:30:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:30:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777602630] [2023-08-24 11:30:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:30:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:30:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:30:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:30:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:30:38,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 154 [2023-08-24 11:30:38,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 536 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:38,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:30:38,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 154 [2023-08-24 11:30:38,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:30:39,161 INFO L124 PetriNetUnfolderBase]: 489/992 cut-off events. [2023-08-24 11:30:39,161 INFO L125 PetriNetUnfolderBase]: For 966/978 co-relation queries the response was YES. [2023-08-24 11:30:39,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 992 events. 489/992 cut-off events. For 966/978 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5517 event pairs, 251 based on Foata normal form. 6/986 useless extension candidates. Maximal degree in co-relation 2630. Up to 627 conditions per place. [2023-08-24 11:30:39,167 INFO L140 encePairwiseOnDemand]: 142/154 looper letters, 72 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2023-08-24 11:30:39,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 99 transitions, 800 flow [2023-08-24 11:30:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:30:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:30:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 487 transitions. [2023-08-24 11:30:39,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3513708513708514 [2023-08-24 11:30:39,169 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 487 transitions. [2023-08-24 11:30:39,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 487 transitions. [2023-08-24 11:30:39,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:30:39,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 487 transitions. [2023-08-24 11:30:39,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 54.111111111111114) internal successors, (487), 9 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:39,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:39,175 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:39,175 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 536 flow. Second operand 9 states and 487 transitions. [2023-08-24 11:30:39,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 99 transitions, 800 flow [2023-08-24 11:30:39,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 772 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 11:30:39,182 INFO L231 Difference]: Finished difference. Result has 109 places, 77 transitions, 551 flow [2023-08-24 11:30:39,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=109, PETRI_TRANSITIONS=77} [2023-08-24 11:30:39,182 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2023-08-24 11:30:39,182 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 77 transitions, 551 flow [2023-08-24 11:30:39,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:30:39,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:30:39,183 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 11:30:39,183 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:30:39,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:30:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1360542986, now seen corresponding path program 1 times [2023-08-24 11:30:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:30:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267131551] [2023-08-24 11:30:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:30:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:30:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:39,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:30:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:30:39,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:30:39,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:30:39,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:30:39,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 11:30:39,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 11:30:39,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 11:30:39,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 11:30:39,226 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:30:39,226 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-24 11:30:39,227 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-24 11:30:39,227 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:30:39,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:30:39 BasicIcfg [2023-08-24 11:30:39,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:30:39,289 INFO L158 Benchmark]: Toolchain (without parser) took 22857.77ms. Allocated memory was 354.4MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 329.9MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 566.0MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,289 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 354.4MB. Free memory is still 331.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:30:39,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.21ms. Allocated memory is still 354.4MB. Free memory was 329.9MB in the beginning and 309.9MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.84ms. Allocated memory is still 354.4MB. Free memory was 309.9MB in the beginning and 307.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,290 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 354.4MB. Free memory was 307.9MB in the beginning and 306.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,291 INFO L158 Benchmark]: RCFGBuilder took 454.26ms. Allocated memory is still 354.4MB. Free memory was 306.3MB in the beginning and 289.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,291 INFO L158 Benchmark]: TraceAbstraction took 21807.65ms. Allocated memory was 354.4MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 289.0MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 526.2MB. Max. memory is 16.0GB. [2023-08-24 11:30:39,294 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.15ms. Allocated memory is still 354.4MB. Free memory is still 331.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 488.21ms. Allocated memory is still 354.4MB. Free memory was 329.9MB in the beginning and 309.9MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.84ms. Allocated memory is still 354.4MB. Free memory was 309.9MB in the beginning and 307.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 354.4MB. Free memory was 307.9MB in the beginning and 306.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 454.26ms. Allocated memory is still 354.4MB. Free memory was 306.3MB in the beginning and 289.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 21807.65ms. Allocated memory was 354.4MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 289.0MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 526.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 269]: Unsoundness Warning unspecified type, defaulting to int C: short [269] - GenericResultAtLocation [Line: 269]: Unsoundness Warning unspecified type, defaulting to int C: short [269] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 520, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 520, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 522, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 522, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3041, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3041, independent: 1787, independent conditional: 0, independent unconditional: 1787, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 995, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2953, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 995, unknown conditional: 0, unknown unconditional: 995] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 95 PlacesBefore, 55 PlacesAfterwards, 95 TransitionsBefore, 51 TransitionsAfterwards, 4752 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 59 TotalNumberOfCompositions, 20874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8432, independent: 8017, independent conditional: 0, independent unconditional: 8017, dependent: 415, dependent conditional: 0, dependent unconditional: 415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2330, independent: 2266, independent conditional: 0, independent unconditional: 2266, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8432, independent: 5751, independent conditional: 0, independent unconditional: 5751, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 2330, unknown conditional: 0, unknown unconditional: 2330] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 405, Positive conditional cache size: 0, Positive unconditional cache size: 405, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 728]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=-2, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, MTX=1, count++=0, count=0] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=0, t={3:0}] [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [COND=1, MTX=0, arg={0:0}, arg={0:0}, count=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 68 locations, 3 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: 2.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 3, 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.2s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 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, 89 locations, 4 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: 3.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 20 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=3, InterpolantAutomatonStates: 40, 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, 0.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 5 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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, 110 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: 13.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 994 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2977 IncrementalHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 87 mSDtfsCounter, 2977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=3, InterpolantAutomatonStates: 86, 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.3s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 2051 SizeOfPredicates, 13 NumberOfNonLiveVariables, 524 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 58/86 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 for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 68 locations, 3 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: 1.8s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 89 locations, 4 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: 0.8s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:30:39,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...