/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 20:00:39,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 20:00:39,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 20:00:39,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 20:00:39,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 20:00:39,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 20:00:39,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 20:00:39,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 20:00:39,216 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 20:00:39,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 20:00:39,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 20:00:39,220 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 20:00:39,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 20:00:39,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 20:00:39,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 20:00:39,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 20:00:39,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 20:00:39,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 20:00:39,222 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 20:00:39,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 20:00:39,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 20:00:39,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 20:00:39,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 20:00:39,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 20:00:39,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 20:00:39,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 20:00:39,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 20:00:39,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 20:00:39,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 20:00:39,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 20:00:39,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 20:00:39,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 20:00:39,378 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 20:00:39,378 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 20:00:39,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-29 20:00:40,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 20:00:40,523 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 20:00:40,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-29 20:00:40,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a71a579b/936472e9bcc04c3fb66173ae2e060033/FLAGeacfed16e [2023-11-29 20:00:40,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a71a579b/936472e9bcc04c3fb66173ae2e060033 [2023-11-29 20:00:40,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 20:00:40,543 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 20:00:40,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 20:00:40,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 20:00:40,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 20:00:40,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6314658c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40, skipping insertion in model container [2023-11-29 20:00:40,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,578 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 20:00:40,753 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2023-11-29 20:00:40,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 20:00:40,771 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 20:00:40,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2023-11-29 20:00:40,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 20:00:40,822 INFO L206 MainTranslator]: Completed translation [2023-11-29 20:00:40,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40 WrapperNode [2023-11-29 20:00:40,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 20:00:40,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 20:00:40,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 20:00:40,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 20:00:40,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,847 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2023-11-29 20:00:40,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 20:00:40,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 20:00:40,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 20:00:40,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 20:00:40,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 20:00:40,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 20:00:40,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 20:00:40,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 20:00:40,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (1/1) ... [2023-11-29 20:00:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 20:00:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:00:40,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 20:00:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 20:00:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 20:00:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 20:00:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 20:00:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 20:00:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 20:00:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 20:00:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 20:00:40,918 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 20:00:41,003 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 20:00:41,005 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 20:00:41,163 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 20:00:41,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 20:00:41,213 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-29 20:00:41,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:00:41 BoogieIcfgContainer [2023-11-29 20:00:41,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 20:00:41,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 20:00:41,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 20:00:41,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 20:00:41,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:00:40" (1/3) ... [2023-11-29 20:00:41,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2748e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:00:41, skipping insertion in model container [2023-11-29 20:00:41,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:00:40" (2/3) ... [2023-11-29 20:00:41,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2748e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:00:41, skipping insertion in model container [2023-11-29 20:00:41,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:00:41" (3/3) ... [2023-11-29 20:00:41,219 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-11-29 20:00:41,259 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 20:00:41,259 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 20:00:41,259 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 20:00:41,303 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 20:00:41,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 153 transitions, 313 flow [2023-11-29 20:00:41,403 INFO L124 PetriNetUnfolderBase]: 33/217 cut-off events. [2023-11-29 20:00:41,403 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 20:00:41,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 217 events. 33/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 770 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2023-11-29 20:00:41,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 153 transitions, 313 flow [2023-11-29 20:00:41,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 148 transitions, 300 flow [2023-11-29 20:00:41,430 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 20:00:41,436 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7919d62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 20:00:41,436 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 20:00:41,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 20:00:41,453 INFO L124 PetriNetUnfolderBase]: 6/88 cut-off events. [2023-11-29 20:00:41,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 20:00:41,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:41,454 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:41,454 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-29 20:00:41,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2003316817, now seen corresponding path program 1 times [2023-11-29 20:00:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866740418] [2023-11-29 20:00:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:00:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:00:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:00:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866740418] [2023-11-29 20:00:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866740418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:00:41,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:00:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 20:00:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665259851] [2023-11-29 20:00:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:00:41,653 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 20:00:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:00:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 20:00:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 20:00:41,680 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153 [2023-11-29 20:00:41,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 148 transitions, 300 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:41,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:00:41,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153 [2023-11-29 20:00:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:00:41,800 INFO L124 PetriNetUnfolderBase]: 81/578 cut-off events. [2023-11-29 20:00:41,800 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 20:00:41,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 578 events. 81/578 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3278 event pairs, 72 based on Foata normal form. 134/677 useless extension candidates. Maximal degree in co-relation 660. Up to 171 conditions per place. [2023-11-29 20:00:41,806 INFO L140 encePairwiseOnDemand]: 133/153 looper letters, 18 selfloop transitions, 0 changer transitions 0/126 dead transitions. [2023-11-29 20:00:41,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 292 flow [2023-11-29 20:00:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 20:00:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 20:00:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2023-11-29 20:00:41,820 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2023-11-29 20:00:41,821 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2023-11-29 20:00:41,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2023-11-29 20:00:41,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:00:41,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2023-11-29 20:00:41,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:41,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:41,833 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:41,836 INFO L307 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2023-11-29 20:00:41,836 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 126 transitions, 292 flow [2023-11-29 20:00:41,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:41,836 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:41,837 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:41,837 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 20:00:41,837 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-29 20:00:41,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 696523965, now seen corresponding path program 1 times [2023-11-29 20:00:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296689375] [2023-11-29 20:00:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 20:00:41,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 20:00:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 20:00:41,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 20:00:41,934 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 20:00:41,938 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-29 20:00:41,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-29 20:00:41,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-29 20:00:41,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-29 20:00:41,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 20:00:41,939 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 20:00:41,941 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 20:00:41,942 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 20:00:41,981 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 20:00:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions, 430 flow [2023-11-29 20:00:42,019 INFO L124 PetriNetUnfolderBase]: 57/361 cut-off events. [2023-11-29 20:00:42,020 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 20:00:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 361 events. 57/361 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1479 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 219. Up to 9 conditions per place. [2023-11-29 20:00:42,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 207 transitions, 430 flow [2023-11-29 20:00:42,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 207 transitions, 430 flow [2023-11-29 20:00:42,025 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 20:00:42,026 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7919d62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 20:00:42,026 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 20:00:42,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 20:00:42,033 INFO L124 PetriNetUnfolderBase]: 6/88 cut-off events. [2023-11-29 20:00:42,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 20:00:42,033 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:42,033 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:42,033 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-29 20:00:42,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1961586366, now seen corresponding path program 1 times [2023-11-29 20:00:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769339248] [2023-11-29 20:00:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:00:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:00:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:00:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769339248] [2023-11-29 20:00:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769339248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:00:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:00:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 20:00:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540012186] [2023-11-29 20:00:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:00:42,084 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 20:00:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:00:42,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 20:00:42,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 20:00:42,086 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 207 [2023-11-29 20:00:42,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 207 transitions, 430 flow. Second operand has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:00:42,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 207 [2023-11-29 20:00:42,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:00:42,766 INFO L124 PetriNetUnfolderBase]: 1733/6447 cut-off events. [2023-11-29 20:00:42,766 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-29 20:00:42,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9147 conditions, 6447 events. 1733/6447 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 65736 event pairs, 1620 based on Foata normal form. 2008/8107 useless extension candidates. Maximal degree in co-relation 8237. Up to 2642 conditions per place. [2023-11-29 20:00:42,800 INFO L140 encePairwiseOnDemand]: 178/207 looper letters, 30 selfloop transitions, 0 changer transitions 0/175 dead transitions. [2023-11-29 20:00:42,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 426 flow [2023-11-29 20:00:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 20:00:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 20:00:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 349 transitions. [2023-11-29 20:00:42,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2023-11-29 20:00:42,803 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 349 transitions. [2023-11-29 20:00:42,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 349 transitions. [2023-11-29 20:00:42,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:00:42,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 349 transitions. [2023-11-29 20:00:42,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,813 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,813 INFO L307 CegarLoopForPetriNet]: 179 programPoint places, -2 predicate places. [2023-11-29 20:00:42,813 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 175 transitions, 426 flow [2023-11-29 20:00:42,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,813 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:42,814 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:42,814 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 20:00:42,815 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-29 20:00:42,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1019071456, now seen corresponding path program 1 times [2023-11-29 20:00:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51639486] [2023-11-29 20:00:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:00:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:00:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:00:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51639486] [2023-11-29 20:00:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51639486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:00:42,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:00:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 20:00:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850880059] [2023-11-29 20:00:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:00:42,980 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 20:00:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:00:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 20:00:42,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 20:00:42,983 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 207 [2023-11-29 20:00:42,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 175 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:42,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:00:42,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 207 [2023-11-29 20:00:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:00:46,029 INFO L124 PetriNetUnfolderBase]: 14073/35015 cut-off events. [2023-11-29 20:00:46,029 INFO L125 PetriNetUnfolderBase]: For 8352/9065 co-relation queries the response was YES. [2023-11-29 20:00:46,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69299 conditions, 35015 events. 14073/35015 cut-off events. For 8352/9065 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 402540 event pairs, 5641 based on Foata normal form. 0/33476 useless extension candidates. Maximal degree in co-relation 58748. Up to 11793 conditions per place. [2023-11-29 20:00:46,184 INFO L140 encePairwiseOnDemand]: 190/207 looper letters, 228 selfloop transitions, 32 changer transitions 5/384 dead transitions. [2023-11-29 20:00:46,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 384 transitions, 1652 flow [2023-11-29 20:00:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 20:00:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 20:00:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1342 transitions. [2023-11-29 20:00:46,187 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7203435319377348 [2023-11-29 20:00:46,187 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1342 transitions. [2023-11-29 20:00:46,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1342 transitions. [2023-11-29 20:00:46,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:00:46,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1342 transitions. [2023-11-29 20:00:46,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.11111111111111) internal successors, (1342), 9 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:46,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:46,194 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:46,194 INFO L307 CegarLoopForPetriNet]: 179 programPoint places, 6 predicate places. [2023-11-29 20:00:46,194 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 384 transitions, 1652 flow [2023-11-29 20:00:46,195 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:46,195 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:46,195 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:46,195 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 20:00:46,195 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-29 20:00:46,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 166279038, now seen corresponding path program 1 times [2023-11-29 20:00:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552639623] [2023-11-29 20:00:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 20:00:46,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 20:00:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 20:00:46,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 20:00:46,217 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 20:00:46,217 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-29 20:00:46,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-29 20:00:46,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-29 20:00:46,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-29 20:00:46,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-29 20:00:46,218 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 20:00:46,218 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 20:00:46,218 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 20:00:46,218 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 20:00:46,237 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 20:00:46,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 261 transitions, 549 flow [2023-11-29 20:00:46,270 INFO L124 PetriNetUnfolderBase]: 86/540 cut-off events. [2023-11-29 20:00:46,270 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 20:00:46,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 540 events. 86/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2308 event pairs, 1 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 369. Up to 16 conditions per place. [2023-11-29 20:00:46,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 261 transitions, 549 flow [2023-11-29 20:00:46,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 261 transitions, 549 flow [2023-11-29 20:00:46,276 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 20:00:46,276 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7919d62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 20:00:46,276 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 20:00:46,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 20:00:46,279 INFO L124 PetriNetUnfolderBase]: 6/88 cut-off events. [2023-11-29 20:00:46,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 20:00:46,279 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:46,279 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:46,279 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-29 20:00:46,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1442384765, now seen corresponding path program 1 times [2023-11-29 20:00:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72420322] [2023-11-29 20:00:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:00:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:00:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:00:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72420322] [2023-11-29 20:00:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72420322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:00:46,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:00:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 20:00:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998979039] [2023-11-29 20:00:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:00:46,292 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 20:00:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:00:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 20:00:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 20:00:46,293 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 261 [2023-11-29 20:00:46,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 261 transitions, 549 flow. Second operand has 2 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:46,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:00:46,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 261 [2023-11-29 20:00:46,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:00:52,694 INFO L124 PetriNetUnfolderBase]: 26755/74037 cut-off events. [2023-11-29 20:00:52,695 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2023-11-29 20:00:52,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110809 conditions, 74037 events. 26755/74037 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 2068. Compared 990698 event pairs, 25579 based on Foata normal form. 26621/97294 useless extension candidates. Maximal degree in co-relation 99850. Up to 35952 conditions per place. [2023-11-29 20:00:53,223 INFO L140 encePairwiseOnDemand]: 223/261 looper letters, 41 selfloop transitions, 0 changer transitions 0/219 dead transitions. [2023-11-29 20:00:53,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 219 transitions, 547 flow [2023-11-29 20:00:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 20:00:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 20:00:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 435 transitions. [2023-11-29 20:00:53,226 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-29 20:00:53,229 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 435 transitions. [2023-11-29 20:00:53,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 435 transitions. [2023-11-29 20:00:53,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:00:53,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 435 transitions. [2023-11-29 20:00:53,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 217.5) internal successors, (435), 2 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:53,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:53,233 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:53,233 INFO L307 CegarLoopForPetriNet]: 224 programPoint places, -3 predicate places. [2023-11-29 20:00:53,234 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 219 transitions, 547 flow [2023-11-29 20:00:53,234 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:53,234 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:00:53,234 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:00:53,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 20:00:53,234 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-29 20:00:53,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:00:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1064034137, now seen corresponding path program 1 times [2023-11-29 20:00:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:00:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703745521] [2023-11-29 20:00:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:00:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:00:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:00:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:00:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:00:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703745521] [2023-11-29 20:00:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703745521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:00:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:00:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 20:00:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540485129] [2023-11-29 20:00:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:00:53,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 20:00:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:00:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 20:00:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 20:00:53,290 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 261 [2023-11-29 20:00:53,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 219 transitions, 547 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:00:53,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:00:53,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 261 [2023-11-29 20:00:53,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:02:03,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][540], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 103#L702-12true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,555 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 20:02:03,555 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 20:02:03,555 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 20:02:03,555 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 20:02:03,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][509], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 190#L702-12true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,575 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 20:02:03,575 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 20:02:03,575 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 20:02:03,575 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 20:02:03,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][542], [t_funThread3of3ForFork0NotInUse, 27#L702-6true, 227#true, 236#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 78#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse]) [2023-11-29 20:02:03,630 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][542], [t_funThread3of3ForFork0NotInUse, 227#true, 143#L702-5true, 236#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 78#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse]) [2023-11-29 20:02:03,631 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][542], [t_funThread3of3ForFork0NotInUse, 227#true, 236#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 78#L716-5true, 68#L691true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse]) [2023-11-29 20:02:03,631 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 20:02:03,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][543], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 73#L691-5true, 238#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse]) [2023-11-29 20:02:03,631 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][543], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 238#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 105#L691-1true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse]) [2023-11-29 20:02:03,632 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][540], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 13#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,632 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 20:02:03,632 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 20:02:03,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][509], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 184#L702-3true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,650 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 20:02:03,650 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 20:02:03,650 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 20:02:03,650 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 20:02:03,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][509], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 84#L702-5true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,761 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 20:02:03,761 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 20:02:03,761 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 20:02:03,761 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 20:02:03,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][540], [t_funThread3of3ForFork0NotInUse, 227#true, 205#L702-7true, 78#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,929 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-29 20:02:03,929 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 20:02:03,930 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 20:02:03,930 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 20:02:03,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][540], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 62#L702-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,952 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-29 20:02:03,952 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 20:02:03,952 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 20:02:03,952 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 20:02:03,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][509], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 159#L702-10true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:03,961 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-29 20:02:03,961 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 20:02:03,961 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 20:02:03,961 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 20:02:04,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1091] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][540], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 66#L703-2true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:04,046 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-29 20:02:04,046 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 20:02:04,046 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 20:02:04,046 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 20:02:04,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][509], [t_funThread3of3ForFork0NotInUse, 227#true, 78#L716-5true, 6#L703-2true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 232#(= ~x~0 0)]) [2023-11-29 20:02:04,050 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-29 20:02:04,050 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 20:02:04,050 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 20:02:04,050 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 20:02:04,088 INFO L124 PetriNetUnfolderBase]: 390037/784181 cut-off events. [2023-11-29 20:02:04,088 INFO L125 PetriNetUnfolderBase]: For 199115/208361 co-relation queries the response was YES. [2023-11-29 20:02:06,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622430 conditions, 784181 events. 390037/784181 cut-off events. For 199115/208361 co-relation queries the response was YES. Maximal size of possible extension queue 20288. Compared 11141550 event pairs, 151014 based on Foata normal form. 0/751613 useless extension candidates. Maximal degree in co-relation 1382339. Up to 293950 conditions per place. [2023-11-29 20:02:10,540 INFO L140 encePairwiseOnDemand]: 240/261 looper letters, 365 selfloop transitions, 46 changer transitions 0/556 dead transitions. [2023-11-29 20:02:10,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 556 transitions, 2512 flow [2023-11-29 20:02:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 20:02:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 20:02:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1727 transitions. [2023-11-29 20:02:10,544 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7352064708386548 [2023-11-29 20:02:10,544 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1727 transitions. [2023-11-29 20:02:10,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1727 transitions. [2023-11-29 20:02:10,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:02:10,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1727 transitions. [2023-11-29 20:02:10,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:02:10,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:02:10,551 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:02:10,552 INFO L307 CegarLoopForPetriNet]: 224 programPoint places, 5 predicate places. [2023-11-29 20:02:10,552 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 556 transitions, 2512 flow [2023-11-29 20:02:10,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:02:10,552 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:02:10,553 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:02:10,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 20:02:10,553 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-29 20:02:10,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:02:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1206305180, now seen corresponding path program 1 times [2023-11-29 20:02:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:02:10,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540978322] [2023-11-29 20:02:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:02:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:02:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:02:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 20:02:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:02:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540978322] [2023-11-29 20:02:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540978322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:02:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:02:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 20:02:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585075607] [2023-11-29 20:02:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:02:10,612 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 20:02:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:02:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 20:02:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 20:02:10,613 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 261 [2023-11-29 20:02:10,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 556 transitions, 2512 flow. Second operand has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:02:10,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:02:10,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 261 [2023-11-29 20:02:10,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand