/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 08:01:45,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 08:01:45,161 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-30 08:01:45,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 08:01:45,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 08:01:45,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 08:01:45,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 08:01:45,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 08:01:45,179 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 08:01:45,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 08:01:45,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 08:01:45,180 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 08:01:45,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 08:01:45,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 08:01:45,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 08:01:45,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 08:01:45,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 08:01:45,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 08:01:45,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 08:01:45,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 08:01:45,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 08:01:45,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 08:01:45,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 08:01:45,183 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 08:01:45,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 08:01:45,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:01:45,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 08:01:45,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 08:01:45,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 08:01:45,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 08:01:45,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 08:01:45,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 08:01:45,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 08:01:45,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-11-30 08:01:45,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 08:01:45,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 08:01:45,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 08:01:45,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 08:01:45,391 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 08:01:45,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i [2023-11-30 08:01:46,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 08:01:46,693 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 08:01:46,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i [2023-11-30 08:01:46,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb33f853/1589e1bdd27446db9640dbdbb58f19db/FLAG6029b697e [2023-11-30 08:01:46,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb33f853/1589e1bdd27446db9640dbdbb58f19db [2023-11-30 08:01:46,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 08:01:46,718 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 08:01:46,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 08:01:46,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 08:01:46,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 08:01:46,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:01:46" (1/1) ... [2023-11-30 08:01:46,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef5e5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:46, skipping insertion in model container [2023-11-30 08:01:46,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:01:46" (1/1) ... [2023-11-30 08:01:46,749 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 08:01:46,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:01:46,944 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 08:01:46,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:01:47,027 INFO L206 MainTranslator]: Completed translation [2023-11-30 08:01:47,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47 WrapperNode [2023-11-30 08:01:47,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 08:01:47,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 08:01:47,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 08:01:47,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 08:01:47,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,075 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2023-11-30 08:01:47,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 08:01:47,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 08:01:47,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 08:01:47,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 08:01:47,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 08:01:47,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 08:01:47,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 08:01:47,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 08:01:47,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (1/1) ... [2023-11-30 08:01:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:01:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:01:47,129 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-30 08:01:47,133 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-30 08:01:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 08:01:47,153 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 08:01:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 08:01:47,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 08:01:47,154 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 08:01:47,269 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 08:01:47,271 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 08:01:47,471 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 08:01:47,499 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 08:01:47,499 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2023-11-30 08:01:47,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:01:47 BoogieIcfgContainer [2023-11-30 08:01:47,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 08:01:47,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 08:01:47,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 08:01:47,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 08:01:47,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 08:01:46" (1/3) ... [2023-11-30 08:01:47,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b84248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:01:47, skipping insertion in model container [2023-11-30 08:01:47,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:01:47" (2/3) ... [2023-11-30 08:01:47,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b84248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:01:47, skipping insertion in model container [2023-11-30 08:01:47,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:01:47" (3/3) ... [2023-11-30 08:01:47,505 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2023-11-30 08:01:47,556 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 08:01:47,556 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 08:01:47,557 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 08:01:47,607 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 08:01:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 170 transitions, 347 flow [2023-11-30 08:01:47,703 INFO L124 PetriNetUnfolderBase]: 32/246 cut-off events. [2023-11-30 08:01:47,704 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 08:01:47,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 246 events. 32/246 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 882 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 134. Up to 6 conditions per place. [2023-11-30 08:01:47,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 170 transitions, 347 flow [2023-11-30 08:01:47,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 167 transitions, 341 flow [2023-11-30 08:01:47,726 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:01:47,740 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;@1cb7bf19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:01:47,740 INFO L363 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-30 08:01:47,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:01:47,747 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-30 08:01:47,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:01:47,747 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:47,750 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] [2023-11-30 08:01:47,751 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:01:47,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2093598898, now seen corresponding path program 1 times [2023-11-30 08:01:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:47,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037239191] [2023-11-30 08:01:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:47,965 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-30 08:01:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037239191] [2023-11-30 08:01:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037239191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955881905] [2023-11-30 08:01:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:47,973 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:47,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:48,001 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 170 [2023-11-30 08:01:48,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 167 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-30 08:01:48,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:48,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 170 [2023-11-30 08:01:48,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:48,235 INFO L124 PetriNetUnfolderBase]: 152/982 cut-off events. [2023-11-30 08:01:48,235 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 08:01:48,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 982 events. 152/982 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6218 event pairs, 10 based on Foata normal form. 152/1036 useless extension candidates. Maximal degree in co-relation 1260. Up to 297 conditions per place. [2023-11-30 08:01:48,244 INFO L140 encePairwiseOnDemand]: 149/170 looper letters, 39 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2023-11-30 08:01:48,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 158 transitions, 405 flow [2023-11-30 08:01:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:01:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:01:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-30 08:01:48,261 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8490196078431372 [2023-11-30 08:01:48,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-30 08:01:48,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-30 08:01:48,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:48,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-30 08:01:48,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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-30 08:01:48,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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-30 08:01:48,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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-30 08:01:48,286 INFO L307 CegarLoopForPetriNet]: 151 programPoint places, -1 predicate places. [2023-11-30 08:01:48,287 INFO L500 AbstractCegarLoop]: Abstraction has has 150 places, 158 transitions, 405 flow [2023-11-30 08:01:48,287 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-30 08:01:48,287 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:48,287 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] [2023-11-30 08:01:48,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 08:01:48,290 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:01:48,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash 97498578, now seen corresponding path program 1 times [2023-11-30 08:01:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820091215] [2023-11-30 08:01:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:48,414 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-30 08:01:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820091215] [2023-11-30 08:01:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820091215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607331732] [2023-11-30 08:01:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:48,416 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:01:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:01:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:01:48,417 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 170 [2023-11-30 08:01:48,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 158 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-30 08:01:48,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:48,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 170 [2023-11-30 08:01:48,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:48,596 INFO L124 PetriNetUnfolderBase]: 182/1027 cut-off events. [2023-11-30 08:01:48,596 INFO L125 PetriNetUnfolderBase]: For 179/233 co-relation queries the response was YES. [2023-11-30 08:01:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 1027 events. 182/1027 cut-off events. For 179/233 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6538 event pairs, 26 based on Foata normal form. 3/931 useless extension candidates. Maximal degree in co-relation 1722. Up to 308 conditions per place. [2023-11-30 08:01:48,602 INFO L140 encePairwiseOnDemand]: 164/170 looper letters, 60 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2023-11-30 08:01:48,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 176 transitions, 609 flow [2023-11-30 08:01:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:01:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:01:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-11-30 08:01:48,604 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7658823529411765 [2023-11-30 08:01:48,604 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-11-30 08:01:48,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-11-30 08:01:48,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:48,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-11-30 08:01:48,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 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-30 08:01:48,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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-30 08:01:48,608 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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-30 08:01:48,608 INFO L307 CegarLoopForPetriNet]: 151 programPoint places, 1 predicate places. [2023-11-30 08:01:48,608 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 176 transitions, 609 flow [2023-11-30 08:01:48,609 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-30 08:01:48,609 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:48,609 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] [2023-11-30 08:01:48,609 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 08:01:48,609 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:01:48,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1737151366, now seen corresponding path program 1 times [2023-11-30 08:01:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153675490] [2023-11-30 08:01:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:48,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 08:01:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:48,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 08:01:48,686 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 08:01:48,687 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-30 08:01:48,690 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2023-11-30 08:01:48,691 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2023-11-30 08:01:48,691 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2023-11-30 08:01:48,691 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2023-11-30 08:01:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2023-11-30 08:01:48,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2023-11-30 08:01:48,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2023-11-30 08:01:48,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2023-11-30 08:01:48,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2023-11-30 08:01:48,699 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2023-11-30 08:01:48,699 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2023-11-30 08:01:48,702 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 08:01:48,702 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 08:01:48,704 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 08:01:48,705 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 08:01:48,744 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 08:01:48,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 221 transitions, 458 flow [2023-11-30 08:01:48,784 INFO L124 PetriNetUnfolderBase]: 54/411 cut-off events. [2023-11-30 08:01:48,785 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 08:01:48,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 411 events. 54/411 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1703 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 248. Up to 9 conditions per place. [2023-11-30 08:01:48,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 221 transitions, 458 flow [2023-11-30 08:01:48,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 221 transitions, 458 flow [2023-11-30 08:01:48,793 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:01:48,794 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;@1cb7bf19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:01:48,794 INFO L363 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-30 08:01:48,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:01:48,798 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-30 08:01:48,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:01:48,798 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:48,798 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] [2023-11-30 08:01:48,798 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:48,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 37405362, now seen corresponding path program 1 times [2023-11-30 08:01:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459339631] [2023-11-30 08:01:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:48,864 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-30 08:01:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459339631] [2023-11-30 08:01:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459339631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144719932] [2023-11-30 08:01:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:48,865 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:48,867 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 221 [2023-11-30 08:01:48,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 221 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:01:48,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:48,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 221 [2023-11-30 08:01:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:50,132 INFO L124 PetriNetUnfolderBase]: 3782/12822 cut-off events. [2023-11-30 08:01:50,132 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-30 08:01:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18627 conditions, 12822 events. 3782/12822 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 137798 event pairs, 1680 based on Foata normal form. 2462/13886 useless extension candidates. Maximal degree in co-relation 1940. Up to 5708 conditions per place. [2023-11-30 08:01:50,196 INFO L140 encePairwiseOnDemand]: 194/221 looper letters, 53 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2023-11-30 08:01:50,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 208 transitions, 542 flow [2023-11-30 08:01:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:01:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:01:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-11-30 08:01:50,198 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.832579185520362 [2023-11-30 08:01:50,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-11-30 08:01:50,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-11-30 08:01:50,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:50,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-11-30 08:01:50,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-30 08:01:50,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-30 08:01:50,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-30 08:01:50,203 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -1 predicate places. [2023-11-30 08:01:50,203 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 542 flow [2023-11-30 08:01:50,203 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:01:50,203 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:50,204 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] [2023-11-30 08:01:50,204 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 08:01:50,204 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:50,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash -174273757, now seen corresponding path program 1 times [2023-11-30 08:01:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:50,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129125120] [2023-11-30 08:01:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:50,241 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-30 08:01:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129125120] [2023-11-30 08:01:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129125120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519434314] [2023-11-30 08:01:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:50,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:01:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:01:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:01:50,243 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 221 [2023-11-30 08:01:50,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-30 08:01:50,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:50,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 221 [2023-11-30 08:01:50,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:51,513 INFO L124 PetriNetUnfolderBase]: 4767/15098 cut-off events. [2023-11-30 08:01:51,514 INFO L125 PetriNetUnfolderBase]: For 3147/4095 co-relation queries the response was YES. [2023-11-30 08:01:51,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29580 conditions, 15098 events. 4767/15098 cut-off events. For 3147/4095 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 163295 event pairs, 2226 based on Foata normal form. 3/13325 useless extension candidates. Maximal degree in co-relation 3237. Up to 7425 conditions per place. [2023-11-30 08:01:51,589 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 79 selfloop transitions, 4 changer transitions 0/231 dead transitions. [2023-11-30 08:01:51,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 231 transitions, 794 flow [2023-11-30 08:01:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:01:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:01:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 835 transitions. [2023-11-30 08:01:51,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.755656108597285 [2023-11-30 08:01:51,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 835 transitions. [2023-11-30 08:01:51,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 835 transitions. [2023-11-30 08:01:51,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:51,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 835 transitions. [2023-11-30 08:01:51,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-30 08:01:51,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 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-30 08:01:51,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 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-30 08:01:51,597 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, 3 predicate places. [2023-11-30 08:01:51,597 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 231 transitions, 794 flow [2023-11-30 08:01:51,598 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-30 08:01:51,598 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:51,598 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, 1, 1, 1] [2023-11-30 08:01:51,598 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 08:01:51,598 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:51,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -279660596, now seen corresponding path program 1 times [2023-11-30 08:01:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336181095] [2023-11-30 08:01:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:01:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336181095] [2023-11-30 08:01:51,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336181095] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:01:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477360196] [2023-11-30 08:01:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:01:51,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:01:51,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:01:51,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 08:01:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:51,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:01:51,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:01:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:01:51,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:01:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:01:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477360196] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:01:51,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:01:51,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 08:01:51,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282596561] [2023-11-30 08:01:51,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:01:51,888 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 08:01:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 08:01:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 08:01:51,890 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 221 [2023-11-30 08:01:51,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 231 transitions, 794 flow. Second operand has 10 states, 10 states have (on average 153.1) internal successors, (1531), 10 states have internal predecessors, (1531), 0 states have call successors, (0), 0 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-30 08:01:51,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:51,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 221 [2023-11-30 08:01:51,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:52,470 INFO L124 PetriNetUnfolderBase]: 1952/4191 cut-off events. [2023-11-30 08:01:52,470 INFO L125 PetriNetUnfolderBase]: For 2286/3563 co-relation queries the response was YES. [2023-11-30 08:01:52,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13078 conditions, 4191 events. 1952/4191 cut-off events. For 2286/3563 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 32781 event pairs, 94 based on Foata normal form. 12/3913 useless extension candidates. Maximal degree in co-relation 1540. Up to 3024 conditions per place. [2023-11-30 08:01:52,498 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 143 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2023-11-30 08:01:52,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 245 transitions, 1392 flow [2023-11-30 08:01:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 08:01:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 08:01:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1654 transitions. [2023-11-30 08:01:52,502 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7484162895927602 [2023-11-30 08:01:52,502 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1654 transitions. [2023-11-30 08:01:52,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1654 transitions. [2023-11-30 08:01:52,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:52,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1654 transitions. [2023-11-30 08:01:52,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 165.4) internal successors, (1654), 10 states have internal predecessors, (1654), 0 states have call successors, (0), 0 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-30 08:01:52,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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-30 08:01:52,509 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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-30 08:01:52,509 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -54 predicate places. [2023-11-30 08:01:52,510 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 245 transitions, 1392 flow [2023-11-30 08:01:52,510 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 153.1) internal successors, (1531), 10 states have internal predecessors, (1531), 0 states have call successors, (0), 0 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-30 08:01:52,510 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:52,510 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, 1, 1, 1, 1] [2023-11-30 08:01:52,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 08:01:52,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-30 08:01:52,716 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:52,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2070501832, now seen corresponding path program 1 times [2023-11-30 08:01:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580935034] [2023-11-30 08:01:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:52,760 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-30 08:01:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580935034] [2023-11-30 08:01:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580935034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975298694] [2023-11-30 08:01:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:52,763 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:52,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:52,764 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 221 [2023-11-30 08:01:52,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 245 transitions, 1392 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:01:52,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:52,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 221 [2023-11-30 08:01:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:52,853 INFO L124 PetriNetUnfolderBase]: 525/1076 cut-off events. [2023-11-30 08:01:52,853 INFO L125 PetriNetUnfolderBase]: For 1455/1613 co-relation queries the response was YES. [2023-11-30 08:01:52,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 1076 events. 525/1076 cut-off events. For 1455/1613 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6317 event pairs, 18 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 1240. Up to 813 conditions per place. [2023-11-30 08:01:52,859 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 56 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2023-11-30 08:01:52,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 782 flow [2023-11-30 08:01:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:01:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:01:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-30 08:01:52,862 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6832579185520362 [2023-11-30 08:01:52,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-30 08:01:52,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-30 08:01:52,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:52,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-30 08:01:52,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-30 08:01:52,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-30 08:01:52,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-30 08:01:52,866 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -112 predicate places. [2023-11-30 08:01:52,866 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 117 transitions, 782 flow [2023-11-30 08:01:52,866 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:01:52,866 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:52,866 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2023-11-30 08:01:52,867 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 08:01:52,867 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:52,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash 68942142, now seen corresponding path program 1 times [2023-11-30 08:01:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476705344] [2023-11-30 08:01:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:01:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476705344] [2023-11-30 08:01:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476705344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:01:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525860427] [2023-11-30 08:01:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:01:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:01:52,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:01:53,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 08:01:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:53,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:01:53,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:01:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:01:53,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:01:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525860427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:53,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:01:53,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 08:01:53,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018885052] [2023-11-30 08:01:53,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:53,084 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 08:01:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 08:01:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 08:01:53,087 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 221 [2023-11-30 08:01:53,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 117 transitions, 782 flow. Second operand has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 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-30 08:01:53,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:53,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 221 [2023-11-30 08:01:53,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:53,214 INFO L124 PetriNetUnfolderBase]: 466/984 cut-off events. [2023-11-30 08:01:53,214 INFO L125 PetriNetUnfolderBase]: For 1594/1742 co-relation queries the response was YES. [2023-11-30 08:01:53,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4472 conditions, 984 events. 466/984 cut-off events. For 1594/1742 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5610 event pairs, 18 based on Foata normal form. 4/936 useless extension candidates. Maximal degree in co-relation 1333. Up to 721 conditions per place. [2023-11-30 08:01:53,220 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 59 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-11-30 08:01:53,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 108 transitions, 824 flow [2023-11-30 08:01:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 08:01:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 08:01:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2023-11-30 08:01:53,222 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7104072398190046 [2023-11-30 08:01:53,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2023-11-30 08:01:53,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2023-11-30 08:01:53,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:53,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2023-11-30 08:01:53,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 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-30 08:01:53,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-30 08:01:53,224 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-30 08:01:53,225 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -111 predicate places. [2023-11-30 08:01:53,225 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 824 flow [2023-11-30 08:01:53,226 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 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-30 08:01:53,226 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:53,226 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 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-30 08:01:53,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 08:01:53,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-30 08:01:53,431 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:53,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1382487645, now seen corresponding path program 1 times [2023-11-30 08:01:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:53,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144913301] [2023-11-30 08:01:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:53,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 08:01:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:53,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 08:01:53,459 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-11-30 08:01:53,460 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-11-30 08:01:53,461 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-11-30 08:01:53,461 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 08:01:53,461 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 08:01:53,462 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 08:01:53,462 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 08:01:53,487 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 08:01:53,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 272 transitions, 571 flow [2023-11-30 08:01:53,528 INFO L124 PetriNetUnfolderBase]: 81/619 cut-off events. [2023-11-30 08:01:53,528 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 08:01:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 619 events. 81/619 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2773 event pairs, 1 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 419. Up to 16 conditions per place. [2023-11-30 08:01:53,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 272 transitions, 571 flow [2023-11-30 08:01:53,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 272 transitions, 571 flow [2023-11-30 08:01:53,538 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:01:53,539 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;@1cb7bf19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:01:53,539 INFO L363 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-30 08:01:53,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:01:53,540 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-30 08:01:53,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:01:53,540 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:53,541 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] [2023-11-30 08:01:53,541 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:01:53,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1140908722, now seen corresponding path program 1 times [2023-11-30 08:01:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802780842] [2023-11-30 08:01:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:53,577 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-30 08:01:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802780842] [2023-11-30 08:01:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802780842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:53,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:53,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:53,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211151022] [2023-11-30 08:01:53,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:53,577 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:53,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:53,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:53,578 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 272 [2023-11-30 08:01:53,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 272 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 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-30 08:01:53,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:53,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 272 [2023-11-30 08:01:53,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:02:09,266 INFO L124 PetriNetUnfolderBase]: 63930/165449 cut-off events. [2023-11-30 08:02:09,267 INFO L125 PetriNetUnfolderBase]: For 2426/2426 co-relation queries the response was YES. [2023-11-30 08:02:09,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252246 conditions, 165449 events. 63930/165449 cut-off events. For 2426/2426 co-relation queries the response was YES. Maximal size of possible extension queue 3399. Compared 2298781 event pairs, 39991 based on Foata normal form. 36106/185466 useless extension candidates. Maximal degree in co-relation 18737. Up to 85786 conditions per place. [2023-11-30 08:02:10,436 INFO L140 encePairwiseOnDemand]: 239/272 looper letters, 65 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2023-11-30 08:02:10,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 253 transitions, 667 flow [2023-11-30 08:02:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:02:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:02:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-30 08:02:10,438 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8198529411764706 [2023-11-30 08:02:10,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-30 08:02:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-30 08:02:10,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:02:10,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-30 08:02:10,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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-30 08:02:10,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-30 08:02:10,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-30 08:02:10,442 INFO L307 CegarLoopForPetriNet]: 243 programPoint places, -1 predicate places. [2023-11-30 08:02:10,443 INFO L500 AbstractCegarLoop]: Abstraction has has 242 places, 253 transitions, 667 flow [2023-11-30 08:02:10,443 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 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-30 08:02:10,443 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:02:10,443 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] [2023-11-30 08:02:10,443 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 08:02:10,443 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:02:10,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:02:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash -519205676, now seen corresponding path program 1 times [2023-11-30 08:02:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:02:10,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443220036] [2023-11-30 08:02:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:02:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:10,475 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-30 08:02:10,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:02:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443220036] [2023-11-30 08:02:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443220036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:02:10,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:02:10,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:02:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291355579] [2023-11-30 08:02:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:02:10,477 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:02:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:02:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:02:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:02:10,478 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 272 [2023-11-30 08:02:10,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 253 transitions, 667 flow. Second operand has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-30 08:02:10,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:02:10,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 272 [2023-11-30 08:02:10,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:02:30,605 INFO L124 PetriNetUnfolderBase]: 83781/210296 cut-off events. [2023-11-30 08:02:30,606 INFO L125 PetriNetUnfolderBase]: For 34464/43734 co-relation queries the response was YES. [2023-11-30 08:02:31,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428916 conditions, 210296 events. 83781/210296 cut-off events. For 34464/43734 co-relation queries the response was YES. Maximal size of possible extension queue 4529. Compared 2953795 event pairs, 52637 based on Foata normal form. 3/188625 useless extension candidates. Maximal degree in co-relation 30889. Up to 112309 conditions per place. [2023-11-30 08:02:32,744 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 91 selfloop transitions, 4 changer transitions 0/276 dead transitions. [2023-11-30 08:02:32,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 276 transitions, 943 flow [2023-11-30 08:02:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:02:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:02:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1012 transitions. [2023-11-30 08:02:32,747 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7441176470588236 [2023-11-30 08:02:32,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1012 transitions. [2023-11-30 08:02:32,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1012 transitions. [2023-11-30 08:02:32,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:02:32,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1012 transitions. [2023-11-30 08:02:32,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-30 08:02:32,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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-30 08:02:32,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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-30 08:02:32,751 INFO L307 CegarLoopForPetriNet]: 243 programPoint places, 3 predicate places. [2023-11-30 08:02:32,751 INFO L500 AbstractCegarLoop]: Abstraction has has 246 places, 276 transitions, 943 flow [2023-11-30 08:02:32,751 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-30 08:02:32,751 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:02:32,752 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, 1, 1, 1] [2023-11-30 08:02:32,752 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 08:02:32,752 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:02:32,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:02:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash 904100413, now seen corresponding path program 1 times [2023-11-30 08:02:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:02:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414172069] [2023-11-30 08:02:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:02:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:02:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:02:32,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414172069] [2023-11-30 08:02:32,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414172069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:02:32,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584878910] [2023-11-30 08:02:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:02:32,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:02:32,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:02:32,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 08:02:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:32,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:02:32,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:02:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:02:32,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:02:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:02:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584878910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:02:32,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:02:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 08:02:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156227954] [2023-11-30 08:02:32,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:02:32,926 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 08:02:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:02:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 08:02:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 08:02:32,928 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 272 [2023-11-30 08:02:32,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 276 transitions, 943 flow. Second operand has 10 states, 10 states have (on average 186.1) internal successors, (1861), 10 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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-30 08:02:32,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:02:32,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 272 [2023-11-30 08:02:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:02:53,203 INFO L124 PetriNetUnfolderBase]: 78917/189713 cut-off events. [2023-11-30 08:02:53,203 INFO L125 PetriNetUnfolderBase]: For 90568/134422 co-relation queries the response was YES. [2023-11-30 08:02:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509554 conditions, 189713 events. 78917/189713 cut-off events. For 90568/134422 co-relation queries the response was YES. Maximal size of possible extension queue 3679. Compared 2550234 event pairs, 7363 based on Foata normal form. 12/171617 useless extension candidates. Maximal degree in co-relation 35923. Up to 108492 conditions per place. [2023-11-30 08:02:55,188 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 233 selfloop transitions, 11 changer transitions 0/425 dead transitions. [2023-11-30 08:02:55,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 425 transitions, 2317 flow [2023-11-30 08:02:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 08:02:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 08:02:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2260 transitions. [2023-11-30 08:02:55,193 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7553475935828877 [2023-11-30 08:02:55,193 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2260 transitions. [2023-11-30 08:02:55,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2260 transitions. [2023-11-30 08:02:55,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:02:55,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2260 transitions. [2023-11-30 08:02:55,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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-30 08:02:55,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 0 states have call successors, (0), 0 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-30 08:02:55,201 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 0 states have call successors, (0), 0 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-30 08:02:55,201 INFO L307 CegarLoopForPetriNet]: 243 programPoint places, 13 predicate places. [2023-11-30 08:02:55,201 INFO L500 AbstractCegarLoop]: Abstraction has has 256 places, 425 transitions, 2317 flow [2023-11-30 08:02:55,202 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.1) internal successors, (1861), 10 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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-30 08:02:55,202 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:02:55,202 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, 1, 1, 1, 1] [2023-11-30 08:02:55,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 08:02:55,406 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:02:55,407 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:02:55,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:02:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 448960809, now seen corresponding path program 1 times [2023-11-30 08:02:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:02:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256217700] [2023-11-30 08:02:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:02:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:55,441 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-30 08:02:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:02:55,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256217700] [2023-11-30 08:02:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256217700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:02:55,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:02:55,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:02:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933352147] [2023-11-30 08:02:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:02:55,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:02:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:02:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:02:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:02:55,445 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 272 [2023-11-30 08:02:55,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 425 transitions, 2317 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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-30 08:02:55,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:02:55,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 272 [2023-11-30 08:02:55,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:04:00,573 INFO L124 PetriNetUnfolderBase]: 236971/514330 cut-off events. [2023-11-30 08:04:00,574 INFO L125 PetriNetUnfolderBase]: For 708181/790317 co-relation queries the response was YES. [2023-11-30 08:04:02,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515496 conditions, 514330 events. 236971/514330 cut-off events. For 708181/790317 co-relation queries the response was YES. Maximal size of possible extension queue 9975. Compared 7215287 event pairs, 114957 based on Foata normal form. 83/469148 useless extension candidates. Maximal degree in co-relation 887789. Up to 226016 conditions per place. [2023-11-30 08:04:05,990 INFO L140 encePairwiseOnDemand]: 257/272 looper letters, 182 selfloop transitions, 12 changer transitions 0/381 dead transitions. [2023-11-30 08:04:05,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 381 transitions, 2254 flow [2023-11-30 08:04:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:04:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:04:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2023-11-30 08:04:05,992 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2023-11-30 08:04:05,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 648 transitions. [2023-11-30 08:04:05,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 648 transitions. [2023-11-30 08:04:05,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:04:05,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 648 transitions. [2023-11-30 08:04:05,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-30 08:04:05,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-30 08:04:05,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-30 08:04:05,996 INFO L307 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2023-11-30 08:04:05,996 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 381 transitions, 2254 flow [2023-11-30 08:04:05,996 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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-30 08:04:05,996 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:04:05,997 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2023-11-30 08:04:05,997 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 08:04:05,997 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:04:05,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:04:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash -457800416, now seen corresponding path program 1 times [2023-11-30 08:04:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:04:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348480001] [2023-11-30 08:04:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:04:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:04:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:04:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:04:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:04:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348480001] [2023-11-30 08:04:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348480001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:04:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742352243] [2023-11-30 08:04:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:04:06,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:04:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:04:06,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:04:06,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 08:04:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:04:06,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:04:06,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:04:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:04:06,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:04:06,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742352243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:04:06,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:04:06,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 08:04:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661368643] [2023-11-30 08:04:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:04:06,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 08:04:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:04:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 08:04:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 08:04:06,157 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 272 [2023-11-30 08:04:06,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 381 transitions, 2254 flow. Second operand has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:04:06,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:04:06,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 272 [2023-11-30 08:04:06,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:04:06,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1041] L703-->L703-3: Formula: (and (= |v_t_funThread3of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{t_funThread3of3ForFork0_#t~nondet5=|v_t_funThread3of3ForFork0_#t~nondet5_1|, #pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet5, #pthreadsMutex][156], [69#L703-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 687#(and (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~post15#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))), 250#true, 138#L703true, 257#true, 131#L713-14true, 246#true]) [2023-11-30 08:04:06,962 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L703-->L703-3: Formula: (and (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|) (= |v_t_funThread2of3ForFork0_#t~nondet5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread2of3ForFork0_#t~nondet5=|v_t_funThread2of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~nondet5][155], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 687#(and (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~post15#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))), 14#L703-3true, 250#true, 138#L703true, 131#L713-14true, 257#true, 62#L703true, 246#true]) [2023-11-30 08:04:06,962 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:06,962 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 08:04:07,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1041] L703-->L703-3: Formula: (and (= |v_t_funThread3of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{t_funThread3of3ForFork0_#t~nondet5=|v_t_funThread3of3ForFork0_#t~nondet5_1|, #pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet5, #pthreadsMutex][165], [t_funThread1of3ForFork0InUse, 69#L703-3true, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 138#L703true, 250#true, 76#L713-15true, 257#true, 246#true]) [2023-11-30 08:04:07,020 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,020 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L703-->L703-3: Formula: (and (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|) (= |v_t_funThread2of3ForFork0_#t~nondet5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread2of3ForFork0_#t~nondet5=|v_t_funThread2of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~nondet5][163], [t_funThread1of3ForFork0InUse, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 14#L703-3true, 138#L703true, 250#true, 76#L713-15true, 257#true, 62#L703true, 246#true]) [2023-11-30 08:04:07,021 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L703-->L703-3: Formula: (and (= |v_t_funThread1of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread1of3ForFork0_#t~nondet5=|v_t_funThread1of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of3ForFork0_#t~nondet5][153], [t_funThread1of3ForFork0InUse, 146#L703-3true, t_funThread2of3ForFork0InUse, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 687#(and (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~post15#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))), 250#true, 131#L713-14true, 257#true, 62#L703true, 246#true]) [2023-11-30 08:04:07,022 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-30 08:04:07,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L703-->L703-3: Formula: (and (= |v_t_funThread1of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread1of3ForFork0_#t~nondet5=|v_t_funThread1of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of3ForFork0_#t~nondet5][161], [t_funThread1of3ForFork0InUse, 146#L703-3true, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 250#true, 76#L713-15true, 257#true, 62#L703true, 246#true]) [2023-11-30 08:04:07,022 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,022 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 08:04:07,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1041] L703-->L703-3: Formula: (and (= |v_t_funThread3of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{t_funThread3of3ForFork0_#t~nondet5=|v_t_funThread3of3ForFork0_#t~nondet5_1|, #pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet5, #pthreadsMutex][165], [t_funThread1of3ForFork0InUse, 69#L703-3true, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, 140#L703true, 540#(= ~x~0 0), t_funThread3of3ForFork0InUse, 250#true, 138#L703true, 257#true, 246#true, 163#L713-16true]) [2023-11-30 08:04:07,088 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,088 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,088 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,088 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L703-->L703-3: Formula: (and (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|) (= |v_t_funThread2of3ForFork0_#t~nondet5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread2of3ForFork0_#t~nondet5=|v_t_funThread2of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~nondet5][163], [t_funThread1of3ForFork0InUse, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, 540#(= ~x~0 0), t_funThread3of3ForFork0InUse, 14#L703-3true, 250#true, 138#L703true, 257#true, 62#L703true, 246#true, 163#L713-16true]) [2023-11-30 08:04:07,089 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,089 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,089 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,089 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L703-->L703-3: Formula: (and (= |v_t_funThread1of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread1of3ForFork0_#t~nondet5=|v_t_funThread1of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of3ForFork0_#t~nondet5][161], [t_funThread1of3ForFork0InUse, 146#L703-3true, 657#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of3ForFork0InUse, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 250#true, 257#true, 62#L703true, 246#true, 163#L713-16true]) [2023-11-30 08:04:07,090 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,090 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,090 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,090 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 08:04:07,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1041] L703-->L703-3: Formula: (and (= |v_t_funThread3of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{t_funThread3of3ForFork0_#t~nondet5=|v_t_funThread3of3ForFork0_#t~nondet5_1|, #pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet5, #pthreadsMutex][175], [t_funThread1of3ForFork0InUse, 69#L703-3true, t_funThread2of3ForFork0InUse, 140#L703true, 540#(= ~x~0 0), 20#L714-31true, t_funThread3of3ForFork0InUse, 250#true, 138#L703true, 257#true, 246#true, 542#true]) [2023-11-30 08:04:07,146 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,146 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,146 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,146 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L703-->L703-3: Formula: (and (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|) (= |v_t_funThread2of3ForFork0_#t~nondet5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread2of3ForFork0_#t~nondet5=|v_t_funThread2of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~nondet5][173], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 20#L714-31true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 14#L703-3true, 250#true, 138#L703true, 257#true, 62#L703true, 246#true, 542#true]) [2023-11-30 08:04:07,147 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L703-->L703-3: Formula: (and (= |v_t_funThread1of3ForFork0_#t~nondet5_1| 0) (= (store |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66| (store (select |v_#pthreadsMutex_170| |v_~#__global_lock~0.base_66|) |v_~#__global_lock~0.offset_66| 0)) |v_#pthreadsMutex_169|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_170|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_169|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_66|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_66|, t_funThread1of3ForFork0_#t~nondet5=|v_t_funThread1of3ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of3ForFork0_#t~nondet5][171], [t_funThread1of3ForFork0InUse, 146#L703-3true, t_funThread2of3ForFork0InUse, 140#L703true, 540#(= ~x~0 0), 20#L714-31true, t_funThread3of3ForFork0InUse, 250#true, 257#true, 62#L703true, 246#true, 542#true]) [2023-11-30 08:04:07,147 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,147 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 08:04:07,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L714-14-->L714-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_42| |v_~#__global_lock~0.base_22|))) (and (= (store |v_#pthreadsMutex_42| |v_~#__global_lock~0.base_22| (store .cse0 |v_~#__global_lock~0.offset_22| 1)) |v_#pthreadsMutex_41|) (= (select .cse0 |v_~#__global_lock~0.offset_22|) 0) (= |v_ULTIMATE.start_main_#t~nondet18#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_42|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_22|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_41|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_22|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet18#1][158], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 4#L714-3true, 140#L703true, t_funThread3of3ForFork0InUse, 540#(= ~x~0 0), 138#L703true, 250#true, 257#true, 62#L703true, 246#true, 542#true]) [2023-11-30 08:04:07,148 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-30 08:04:07,148 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 08:04:07,148 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 08:04:07,148 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event