/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/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 09:29:16,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 09:29:16,258 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 09:29:16,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 09:29:16,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 09:29:16,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 09:29:16,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 09:29:16,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 09:29:16,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 09:29:16,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 09:29:16,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 09:29:16,289 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 09:29:16,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 09:29:16,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 09:29:16,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 09:29:16,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 09:29:16,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 09:29:16,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 09:29:16,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 09:29:16,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 09:29:16,291 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 09:29:16,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 09:29:16,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 09:29:16,292 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 09:29:16,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 09:29:16,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:29:16,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 09:29:16,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 09:29:16,293 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 09:29:16,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 09:29:16,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 09:29:16,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 09:29:16,487 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 09:29:16,487 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 09:29:16,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2023-11-30 09:29:17,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 09:29:17,623 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 09:29:17,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2023-11-30 09:29:17,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9edc209/31ae2d6e10904187a46b7a53cf95c393/FLAGaa8269f4d [2023-11-30 09:29:17,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9edc209/31ae2d6e10904187a46b7a53cf95c393 [2023-11-30 09:29:17,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 09:29:17,643 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 09:29:17,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 09:29:17,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 09:29:17,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 09:29:17,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ddf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17, skipping insertion in model container [2023-11-30 09:29:17,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,666 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 09:29:17,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:29:17,801 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 09:29:17,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:29:17,830 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:29:17,830 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:29:17,834 INFO L206 MainTranslator]: Completed translation [2023-11-30 09:29:17,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17 WrapperNode [2023-11-30 09:29:17,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 09:29:17,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 09:29:17,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 09:29:17,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 09:29:17,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,873 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 87 [2023-11-30 09:29:17,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 09:29:17,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 09:29:17,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 09:29:17,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 09:29:17,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 09:29:17,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 09:29:17,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 09:29:17,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 09:29:17,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (1/1) ... [2023-11-30 09:29:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:29:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:17,953 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 09:29:17,960 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 09:29:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 09:29:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 09:29:17,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 09:29:17,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 09:29:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 09:29:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 09:29:17,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 09:29:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 09:29:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 09:29:17,992 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 09:29:18,049 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 09:29:18,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 09:29:18,228 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 09:29:18,272 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 09:29:18,272 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 09:29:18,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:29:18 BoogieIcfgContainer [2023-11-30 09:29:18,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 09:29:18,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 09:29:18,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 09:29:18,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 09:29:18,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 09:29:17" (1/3) ... [2023-11-30 09:29:18,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe2c9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:29:18, skipping insertion in model container [2023-11-30 09:29:18,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:29:17" (2/3) ... [2023-11-30 09:29:18,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe2c9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:29:18, skipping insertion in model container [2023-11-30 09:29:18,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:29:18" (3/3) ... [2023-11-30 09:29:18,283 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2023-11-30 09:29:18,294 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 09:29:18,294 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-30 09:29:18,294 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 09:29:18,350 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 09:29:18,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 109 transitions, 232 flow [2023-11-30 09:29:18,415 INFO L124 PetriNetUnfolderBase]: 6/107 cut-off events. [2023-11-30 09:29:18,416 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 09:29:18,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 107 events. 6/107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-30 09:29:18,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 109 transitions, 232 flow [2023-11-30 09:29:18,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 86 transitions, 184 flow [2023-11-30 09:29:18,436 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 09:29:18,440 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;@73ffbf8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 09:29:18,440 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-11-30 09:29:18,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 09:29:18,451 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-30 09:29:18,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 09:29:18,451 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:18,452 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] [2023-11-30 09:29:18,452 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:18,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 731920888, now seen corresponding path program 1 times [2023-11-30 09:29:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296583632] [2023-11-30 09:29:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:18,717 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 09:29:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296583632] [2023-11-30 09:29:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296583632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:29:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 09:29:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546933816] [2023-11-30 09:29:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:18,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:29:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:29:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:29:18,769 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:29:18,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 09:29:18,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:18,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:29:18,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:18,867 INFO L124 PetriNetUnfolderBase]: 19/176 cut-off events. [2023-11-30 09:29:18,867 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2023-11-30 09:29:18,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 176 events. 19/176 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 566 event pairs, 8 based on Foata normal form. 16/158 useless extension candidates. Maximal degree in co-relation 141. Up to 33 conditions per place. [2023-11-30 09:29:18,871 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 12 selfloop transitions, 2 changer transitions 1/86 dead transitions. [2023-11-30 09:29:18,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 221 flow [2023-11-30 09:29:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:29:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:29:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-11-30 09:29:18,883 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9204892966360856 [2023-11-30 09:29:18,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-11-30 09:29:18,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-11-30 09:29:18,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:18,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-11-30 09:29:18,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 09:29:18,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 09:29:18,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 09:29:18,894 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2023-11-30 09:29:18,895 INFO L500 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 221 flow [2023-11-30 09:29:18,895 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 09:29:18,895 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:18,895 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:18,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 09:29:18,895 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:18,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -998651844, now seen corresponding path program 1 times [2023-11-30 09:29:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076071726] [2023-11-30 09:29:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:18,966 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 09:29:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076071726] [2023-11-30 09:29:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076071726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:29:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:29:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160549841] [2023-11-30 09:29:18,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:18,968 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:29:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:29:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:29:18,969 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:18,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:29:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:19,048 INFO L124 PetriNetUnfolderBase]: 101/276 cut-off events. [2023-11-30 09:29:19,049 INFO L125 PetriNetUnfolderBase]: For 137/144 co-relation queries the response was YES. [2023-11-30 09:29:19,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 276 events. 101/276 cut-off events. For 137/144 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1220 event pairs, 1 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 549. Up to 138 conditions per place. [2023-11-30 09:29:19,051 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 37 selfloop transitions, 5 changer transitions 1/104 dead transitions. [2023-11-30 09:29:19,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 104 transitions, 373 flow [2023-11-30 09:29:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:29:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:29:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2023-11-30 09:29:19,053 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8348623853211009 [2023-11-30 09:29:19,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 455 transitions. [2023-11-30 09:29:19,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 455 transitions. [2023-11-30 09:29:19,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:19,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 455 transitions. [2023-11-30 09:29:19,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 09:29:19,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 09:29:19,057 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 09:29:19,057 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-11-30 09:29:19,057 INFO L500 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 373 flow [2023-11-30 09:29:19,058 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:29:19,058 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:19,058 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:19,058 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 09:29:19,058 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:19,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -510933420, now seen corresponding path program 1 times [2023-11-30 09:29:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171719591] [2023-11-30 09:29:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171719591] [2023-11-30 09:29:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171719591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:19,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473502035] [2023-11-30 09:29:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:19,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:19,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:19,149 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 09:29:19,150 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 09:29:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:19,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 09:29:19,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:19,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473502035] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:19,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-30 09:29:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500045137] [2023-11-30 09:29:19,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:19,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 09:29:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 09:29:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-30 09:29:19,340 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:29:19,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 373 flow. Second operand has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 09:29:19,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:19,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:29:19,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:19,451 INFO L124 PetriNetUnfolderBase]: 185/732 cut-off events. [2023-11-30 09:29:19,451 INFO L125 PetriNetUnfolderBase]: For 783/818 co-relation queries the response was YES. [2023-11-30 09:29:19,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 732 events. 185/732 cut-off events. For 783/818 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4841 event pairs, 30 based on Foata normal form. 21/593 useless extension candidates. Maximal degree in co-relation 1444. Up to 343 conditions per place. [2023-11-30 09:29:19,457 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 28 selfloop transitions, 15 changer transitions 1/123 dead transitions. [2023-11-30 09:29:19,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 123 transitions, 609 flow [2023-11-30 09:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:29:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:29:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-11-30 09:29:19,459 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9030144167758847 [2023-11-30 09:29:19,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-11-30 09:29:19,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-11-30 09:29:19,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:19,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-11-30 09:29:19,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 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 09:29:19,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:19,462 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:19,463 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2023-11-30 09:29:19,463 INFO L500 AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 609 flow [2023-11-30 09:29:19,463 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 09:29:19,463 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:19,463 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:19,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 09:29:19,668 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:19,669 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:19,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash -510933421, now seen corresponding path program 1 times [2023-11-30 09:29:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534522671] [2023-11-30 09:29:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534522671] [2023-11-30 09:29:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534522671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962596845] [2023-11-30 09:29:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:19,729 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 09:29:19,758 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 09:29:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:19,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 09:29:19,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:19,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:29:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962596845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:29:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-30 09:29:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313811933] [2023-11-30 09:29:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:19,814 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:29:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:29:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 09:29:19,816 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:29:19,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 609 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 09:29:19,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:19,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:29:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:19,904 INFO L124 PetriNetUnfolderBase]: 213/933 cut-off events. [2023-11-30 09:29:19,904 INFO L125 PetriNetUnfolderBase]: For 1470/1517 co-relation queries the response was YES. [2023-11-30 09:29:19,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 933 events. 213/933 cut-off events. For 1470/1517 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6055 event pairs, 44 based on Foata normal form. 16/748 useless extension candidates. Maximal degree in co-relation 1924. Up to 394 conditions per place. [2023-11-30 09:29:19,910 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 34 selfloop transitions, 14 changer transitions 1/128 dead transitions. [2023-11-30 09:29:19,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 128 transitions, 754 flow [2023-11-30 09:29:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:29:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:29:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2023-11-30 09:29:19,912 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8853211009174312 [2023-11-30 09:29:19,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2023-11-30 09:29:19,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2023-11-30 09:29:19,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:19,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2023-11-30 09:29:19,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 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 09:29:19,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 09:29:19,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 09:29:19,915 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-11-30 09:29:19,915 INFO L500 AbstractCegarLoop]: Abstraction has has 100 places, 128 transitions, 754 flow [2023-11-30 09:29:19,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 09:29:19,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:19,916 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:19,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 09:29:20,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-30 09:29:20,121 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:20,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1380734505, now seen corresponding path program 1 times [2023-11-30 09:29:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054782202] [2023-11-30 09:29:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054782202] [2023-11-30 09:29:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054782202] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233306298] [2023-11-30 09:29:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:20,218 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 09:29:20,258 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 09:29:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:20,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:20,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:20,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:29:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233306298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:20,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:29:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 09:29:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442358138] [2023-11-30 09:29:20,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:20,312 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:29:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:29:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 09:29:20,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:20,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 128 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 09:29:20,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:20,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:20,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:20,439 INFO L124 PetriNetUnfolderBase]: 198/670 cut-off events. [2023-11-30 09:29:20,439 INFO L125 PetriNetUnfolderBase]: For 1797/2014 co-relation queries the response was YES. [2023-11-30 09:29:20,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 670 events. 198/670 cut-off events. For 1797/2014 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3682 event pairs, 11 based on Foata normal form. 16/555 useless extension candidates. Maximal degree in co-relation 1957. Up to 365 conditions per place. [2023-11-30 09:29:20,460 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 80 selfloop transitions, 8 changer transitions 1/150 dead transitions. [2023-11-30 09:29:20,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 1177 flow [2023-11-30 09:29:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:29:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:29:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 621 transitions. [2023-11-30 09:29:20,462 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8138925294888598 [2023-11-30 09:29:20,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 621 transitions. [2023-11-30 09:29:20,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 621 transitions. [2023-11-30 09:29:20,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:20,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 621 transitions. [2023-11-30 09:29:20,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.71428571428571) internal successors, (621), 7 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:29:20,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:20,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:20,466 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 17 predicate places. [2023-11-30 09:29:20,466 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 150 transitions, 1177 flow [2023-11-30 09:29:20,466 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 09:29:20,466 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:20,466 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:20,474 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 09:29:20,671 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:20,671 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:20,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash 146903635, now seen corresponding path program 1 times [2023-11-30 09:29:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350676934] [2023-11-30 09:29:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350676934] [2023-11-30 09:29:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350676934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256937514] [2023-11-30 09:29:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:20,736 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 09:29:20,760 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 09:29:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:20,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:20,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:20,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256937514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:20,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:29:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945908306] [2023-11-30 09:29:20,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:20,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:29:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:29:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:29:20,876 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:20,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 150 transitions, 1177 flow. Second operand has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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 09:29:20,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:20,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:20,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:21,106 INFO L124 PetriNetUnfolderBase]: 295/918 cut-off events. [2023-11-30 09:29:21,106 INFO L125 PetriNetUnfolderBase]: For 2573/2959 co-relation queries the response was YES. [2023-11-30 09:29:21,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3859 conditions, 918 events. 295/918 cut-off events. For 2573/2959 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5223 event pairs, 1 based on Foata normal form. 27/785 useless extension candidates. Maximal degree in co-relation 3458. Up to 565 conditions per place. [2023-11-30 09:29:21,111 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 156 selfloop transitions, 18 changer transitions 1/236 dead transitions. [2023-11-30 09:29:21,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 236 transitions, 2440 flow [2023-11-30 09:29:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:29:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:29:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1245 transitions. [2023-11-30 09:29:21,113 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8158584534731324 [2023-11-30 09:29:21,113 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1245 transitions. [2023-11-30 09:29:21,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1245 transitions. [2023-11-30 09:29:21,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:21,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1245 transitions. [2023-11-30 09:29:21,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.92857142857143) internal successors, (1245), 14 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 09:29:21,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:29:21,119 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:29:21,121 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2023-11-30 09:29:21,121 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 236 transitions, 2440 flow [2023-11-30 09:29:21,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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 09:29:21,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:21,122 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, 1, 1] [2023-11-30 09:29:21,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-30 09:29:21,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:21,326 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:21,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1825969836, now seen corresponding path program 1 times [2023-11-30 09:29:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905063597] [2023-11-30 09:29:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:21,375 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 09:29:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905063597] [2023-11-30 09:29:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905063597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:29:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:29:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288132997] [2023-11-30 09:29:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:21,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:29:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:29:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:29:21,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:21,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 236 transitions, 2440 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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 09:29:21,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:21,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:21,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:21,577 INFO L124 PetriNetUnfolderBase]: 711/1953 cut-off events. [2023-11-30 09:29:21,577 INFO L125 PetriNetUnfolderBase]: For 14844/17234 co-relation queries the response was YES. [2023-11-30 09:29:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9123 conditions, 1953 events. 711/1953 cut-off events. For 14844/17234 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14854 event pairs, 163 based on Foata normal form. 102/1498 useless extension candidates. Maximal degree in co-relation 8268. Up to 1091 conditions per place. [2023-11-30 09:29:21,590 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 226 selfloop transitions, 5 changer transitions 1/323 dead transitions. [2023-11-30 09:29:21,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 323 transitions, 4090 flow [2023-11-30 09:29:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:29:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:29:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2023-11-30 09:29:21,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8348623853211009 [2023-11-30 09:29:21,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 455 transitions. [2023-11-30 09:29:21,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 455 transitions. [2023-11-30 09:29:21,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:21,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 455 transitions. [2023-11-30 09:29:21,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 09:29:21,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 09:29:21,593 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 09:29:21,594 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2023-11-30 09:29:21,594 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 323 transitions, 4090 flow [2023-11-30 09:29:21,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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 09:29:21,594 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:21,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:21,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 09:29:21,594 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:21,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1659724650, now seen corresponding path program 1 times [2023-11-30 09:29:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:21,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790762575] [2023-11-30 09:29:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:21,660 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 09:29:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790762575] [2023-11-30 09:29:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790762575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:29:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 09:29:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535980392] [2023-11-30 09:29:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:21,661 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:29:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:29:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-30 09:29:21,662 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 109 [2023-11-30 09:29:21,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 323 transitions, 4090 flow. Second operand has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 09:29:21,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:21,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 109 [2023-11-30 09:29:21,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:22,101 INFO L124 PetriNetUnfolderBase]: 1007/3370 cut-off events. [2023-11-30 09:29:22,101 INFO L125 PetriNetUnfolderBase]: For 15168/16212 co-relation queries the response was YES. [2023-11-30 09:29:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15029 conditions, 3370 events. 1007/3370 cut-off events. For 15168/16212 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28343 event pairs, 336 based on Foata normal form. 101/2861 useless extension candidates. Maximal degree in co-relation 13780. Up to 1935 conditions per place. [2023-11-30 09:29:22,122 INFO L140 encePairwiseOnDemand]: 98/109 looper letters, 292 selfloop transitions, 10 changer transitions 1/380 dead transitions. [2023-11-30 09:29:22,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 380 transitions, 5394 flow [2023-11-30 09:29:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 09:29:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 09:29:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 621 transitions. [2023-11-30 09:29:22,124 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7121559633027523 [2023-11-30 09:29:22,124 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 621 transitions. [2023-11-30 09:29:22,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 621 transitions. [2023-11-30 09:29:22,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:22,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 621 transitions. [2023-11-30 09:29:22,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:29:22,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 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 09:29:22,127 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 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 09:29:22,129 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 41 predicate places. [2023-11-30 09:29:22,130 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 380 transitions, 5394 flow [2023-11-30 09:29:22,130 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 09:29:22,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:22,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:22,130 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 09:29:22,131 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:22,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2059365530, now seen corresponding path program 1 times [2023-11-30 09:29:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903231158] [2023-11-30 09:29:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:22,272 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 09:29:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903231158] [2023-11-30 09:29:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903231158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:29:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 09:29:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640096789] [2023-11-30 09:29:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:22,272 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 09:29:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 09:29:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-30 09:29:22,273 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 109 [2023-11-30 09:29:22,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 380 transitions, 5394 flow. Second operand has 7 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 09:29:22,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:22,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 109 [2023-11-30 09:29:22,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:22,819 INFO L124 PetriNetUnfolderBase]: 1149/3642 cut-off events. [2023-11-30 09:29:22,820 INFO L125 PetriNetUnfolderBase]: For 18259/18629 co-relation queries the response was YES. [2023-11-30 09:29:22,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17815 conditions, 3642 events. 1149/3642 cut-off events. For 18259/18629 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30064 event pairs, 431 based on Foata normal form. 19/2970 useless extension candidates. Maximal degree in co-relation 16640. Up to 2049 conditions per place. [2023-11-30 09:29:22,853 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 300 selfloop transitions, 6 changer transitions 18/391 dead transitions. [2023-11-30 09:29:22,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 391 transitions, 6136 flow [2023-11-30 09:29:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 09:29:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 09:29:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 562 transitions. [2023-11-30 09:29:22,855 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6444954128440367 [2023-11-30 09:29:22,855 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 562 transitions. [2023-11-30 09:29:22,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 562 transitions. [2023-11-30 09:29:22,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:22,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 562 transitions. [2023-11-30 09:29:22,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 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 09:29:22,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 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 09:29:22,857 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 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 09:29:22,858 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 48 predicate places. [2023-11-30 09:29:22,858 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 391 transitions, 6136 flow [2023-11-30 09:29:22,859 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 09:29:22,859 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:22,859 INFO L232 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:22,859 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 09:29:22,859 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:22,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -503439652, now seen corresponding path program 1 times [2023-11-30 09:29:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442288590] [2023-11-30 09:29:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:29:22,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:22,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442288590] [2023-11-30 09:29:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442288590] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:22,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769664382] [2023-11-30 09:29:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:22,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:22,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:22,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 09:29:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:22,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:22,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:29:23,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:29:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769664382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:23,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:29:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 09:29:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995133658] [2023-11-30 09:29:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:23,008 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:29:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:29:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 09:29:23,009 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:23,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 391 transitions, 6136 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 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 09:29:23,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:23,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:23,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:23,469 INFO L124 PetriNetUnfolderBase]: 1074/3161 cut-off events. [2023-11-30 09:29:23,470 INFO L125 PetriNetUnfolderBase]: For 21049/21549 co-relation queries the response was YES. [2023-11-30 09:29:23,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17241 conditions, 3161 events. 1074/3161 cut-off events. For 21049/21549 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 24848 event pairs, 322 based on Foata normal form. 77/2643 useless extension candidates. Maximal degree in co-relation 15543. Up to 1623 conditions per place. [2023-11-30 09:29:23,493 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 294 selfloop transitions, 8 changer transitions 18/437 dead transitions. [2023-11-30 09:29:23,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 437 transitions, 7740 flow [2023-11-30 09:29:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:29:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:29:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 625 transitions. [2023-11-30 09:29:23,495 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8191349934469201 [2023-11-30 09:29:23,495 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 625 transitions. [2023-11-30 09:29:23,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 625 transitions. [2023-11-30 09:29:23,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:23,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 625 transitions. [2023-11-30 09:29:23,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 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 09:29:23,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:23,497 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 09:29:23,498 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 53 predicate places. [2023-11-30 09:29:23,498 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 437 transitions, 7740 flow [2023-11-30 09:29:23,498 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 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 09:29:23,498 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:23,498 INFO L232 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:23,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-30 09:29:23,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-30 09:29:23,704 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:23,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1000853640, now seen corresponding path program 1 times [2023-11-30 09:29:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861976421] [2023-11-30 09:29:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:29:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861976421] [2023-11-30 09:29:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861976421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618397993] [2023-11-30 09:29:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:23,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:23,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 09:29:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:23,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:23,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:29:23,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:29:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618397993] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:23,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:29:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106645761] [2023-11-30 09:29:23,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:23,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:29:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:29:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:29:23,964 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2023-11-30 09:29:23,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 437 transitions, 7740 flow. Second operand has 12 states, 12 states have (on average 86.0) internal successors, (1032), 12 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 09:29:23,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:23,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2023-11-30 09:29:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:24,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][196], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, 1176#true, thread1Thread1of1ForFork1NotInUse, 5#L72-2true, 953#(<= 0 (+ ~N1~0 2147483648)), 978#true, 507#true, 103#L58true, 942#true, 126#(= ~counter~0 0), 409#(<= 0 ~counter~0)]) [2023-11-30 09:29:24,842 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 09:29:24,842 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:24,842 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 09:29:24,843 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:24,918 INFO L124 PetriNetUnfolderBase]: 2254/5960 cut-off events. [2023-11-30 09:29:24,918 INFO L125 PetriNetUnfolderBase]: For 49434/50521 co-relation queries the response was YES. [2023-11-30 09:29:24,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37746 conditions, 5960 events. 2254/5960 cut-off events. For 49434/50521 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 49670 event pairs, 567 based on Foata normal form. 127/4875 useless extension candidates. Maximal degree in co-relation 35915. Up to 3268 conditions per place. [2023-11-30 09:29:24,973 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 620 selfloop transitions, 18 changer transitions 18/773 dead transitions. [2023-11-30 09:29:24,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 773 transitions, 16293 flow [2023-11-30 09:29:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:29:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:29:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1258 transitions. [2023-11-30 09:29:24,976 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8243774574049804 [2023-11-30 09:29:24,976 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1258 transitions. [2023-11-30 09:29:24,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1258 transitions. [2023-11-30 09:29:24,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:24,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1258 transitions. [2023-11-30 09:29:24,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.85714285714286) internal successors, (1258), 14 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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 09:29:24,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:29:24,981 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:29:24,981 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 66 predicate places. [2023-11-30 09:29:24,981 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 773 transitions, 16293 flow [2023-11-30 09:29:24,982 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 86.0) internal successors, (1032), 12 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 09:29:24,982 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:24,982 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:29:24,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 09:29:25,187 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:25,189 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:25,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:25,190 INFO L85 PathProgramCache]: Analyzing trace with hash -349681351, now seen corresponding path program 2 times [2023-11-30 09:29:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54529275] [2023-11-30 09:29:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54529275] [2023-11-30 09:29:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54529275] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085273159] [2023-11-30 09:29:25,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:29:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:25,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:25,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 09:29:25,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:29:25,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:29:25,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 09:29:25,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:25,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085273159] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:25,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-30 09:29:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101800209] [2023-11-30 09:29:25,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:25,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:29:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:29:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-30 09:29:25,452 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:29:25,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 773 transitions, 16293 flow. Second operand has 13 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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 09:29:25,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:25,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:29:25,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:26,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [113#true, 1578#(= ~counter~0 0), 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, 1176#true, thread1Thread1of1ForFork1NotInUse, 5#L72-2true, 953#(<= 0 (+ ~N1~0 2147483648)), 978#true, 507#true, 103#L58true, 942#true, 126#(= ~counter~0 0), 409#(<= 0 ~counter~0)]) [2023-11-30 09:29:26,582 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 09:29:26,582 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 09:29:26,582 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:26,582 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:28,102 INFO L124 PetriNetUnfolderBase]: 5407/14526 cut-off events. [2023-11-30 09:29:28,103 INFO L125 PetriNetUnfolderBase]: For 178781/181703 co-relation queries the response was YES. [2023-11-30 09:29:28,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95018 conditions, 14526 events. 5407/14526 cut-off events. For 178781/181703 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 141647 event pairs, 1788 based on Foata normal form. 85/11838 useless extension candidates. Maximal degree in co-relation 91870. Up to 7847 conditions per place. [2023-11-30 09:29:28,222 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 661 selfloop transitions, 769 changer transitions 18/1609 dead transitions. [2023-11-30 09:29:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1609 transitions, 40254 flow [2023-11-30 09:29:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 09:29:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 09:29:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1183 transitions. [2023-11-30 09:29:28,224 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.904434250764526 [2023-11-30 09:29:28,224 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1183 transitions. [2023-11-30 09:29:28,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1183 transitions. [2023-11-30 09:29:28,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:28,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1183 transitions. [2023-11-30 09:29:28,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.58333333333333) internal successors, (1183), 12 states have internal predecessors, (1183), 0 states have call successors, (0), 0 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 09:29:28,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 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 09:29:28,229 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 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 09:29:28,230 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 77 predicate places. [2023-11-30 09:29:28,230 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 1609 transitions, 40254 flow [2023-11-30 09:29:28,230 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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 09:29:28,230 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:28,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:29:28,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-30 09:29:28,435 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:28,436 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:28,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1050447899, now seen corresponding path program 1 times [2023-11-30 09:29:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803629529] [2023-11-30 09:29:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:28,577 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 09:29:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:28,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803629529] [2023-11-30 09:29:28,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803629529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:28,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388426242] [2023-11-30 09:29:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:28,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:28,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:28,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:28,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 09:29:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:28,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 09:29:28,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:29:28,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:29:28,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388426242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:29:28,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:29:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2023-11-30 09:29:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931107817] [2023-11-30 09:29:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:29:28,862 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 09:29:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 09:29:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-30 09:29:28,863 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 109 [2023-11-30 09:29:28,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1609 transitions, 40254 flow. Second operand has 7 states, 7 states have (on average 66.42857142857143) internal successors, (465), 7 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 09:29:28,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:28,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 109 [2023-11-30 09:29:28,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:30,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][197], [113#true, 1578#(= ~counter~0 0), 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 1176#true, 5#L72-2true, 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 978#true, 953#(<= 0 (+ ~N1~0 2147483648)), 507#true, 103#L58true, 942#true, 409#(<= 0 ~counter~0), 126#(= ~counter~0 0)]) [2023-11-30 09:29:30,869 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 09:29:30,869 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:30,869 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 09:29:30,869 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:33,176 INFO L124 PetriNetUnfolderBase]: 5407/14648 cut-off events. [2023-11-30 09:29:33,177 INFO L125 PetriNetUnfolderBase]: For 209810/212694 co-relation queries the response was YES. [2023-11-30 09:29:33,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102218 conditions, 14648 events. 5407/14648 cut-off events. For 209810/212694 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 142612 event pairs, 1682 based on Foata normal form. 56/11914 useless extension candidates. Maximal degree in co-relation 98939. Up to 7884 conditions per place. [2023-11-30 09:29:33,303 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 1448 selfloop transitions, 8 changer transitions 58/1608 dead transitions. [2023-11-30 09:29:33,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1608 transitions, 43274 flow [2023-11-30 09:29:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 09:29:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 09:29:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 597 transitions. [2023-11-30 09:29:33,305 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6085626911314985 [2023-11-30 09:29:33,305 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 597 transitions. [2023-11-30 09:29:33,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 597 transitions. [2023-11-30 09:29:33,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:33,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 597 transitions. [2023-11-30 09:29:33,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 66.33333333333333) internal successors, (597), 9 states have internal predecessors, (597), 0 states have call successors, (0), 0 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 09:29:33,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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 09:29:33,308 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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 09:29:33,309 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 84 predicate places. [2023-11-30 09:29:33,309 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 1608 transitions, 43274 flow [2023-11-30 09:29:33,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.42857142857143) internal successors, (465), 7 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 09:29:33,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:33,309 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:29:33,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 09:29:33,529 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-30 09:29:33,529 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:33,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2061113010, now seen corresponding path program 2 times [2023-11-30 09:29:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114037742] [2023-11-30 09:29:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114037742] [2023-11-30 09:29:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114037742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494353660] [2023-11-30 09:29:33,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:29:33,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:33,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:33,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 09:29:33,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:29:33,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:29:33,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:33,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-30 09:29:33,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-30 09:29:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494353660] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:33,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2023-11-30 09:29:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650173700] [2023-11-30 09:29:33,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:33,891 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 09:29:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 09:29:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-30 09:29:33,893 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 109 [2023-11-30 09:29:33,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1608 transitions, 43274 flow. Second operand has 16 states, 16 states have (on average 73.75) internal successors, (1180), 16 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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 09:29:33,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:33,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 109 [2023-11-30 09:29:33,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:36,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [113#true, 1578#(= ~counter~0 0), 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 1176#true, 5#L72-2true, 953#(<= 0 (+ ~N1~0 2147483648)), 978#true, 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 507#true, 103#L58true, 2241#(<= ~N1~0 2147483647), 942#true, 409#(<= 0 ~counter~0), 126#(= ~counter~0 0)]) [2023-11-30 09:29:36,344 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 09:29:36,344 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 09:29:36,344 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:36,344 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:36,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][277], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, 1176#true, thread1Thread1of1ForFork1NotInUse, 5#L72-2true, 277#(< ~counter~0 2147483646), 978#true, 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 953#(<= 0 (+ ~N1~0 2147483648)), 507#true, 103#L58true, 942#true, 2241#(<= ~N1~0 2147483647), 1579#(<= ~counter~0 1), 409#(<= 0 ~counter~0)]) [2023-11-30 09:29:36,961 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-30 09:29:36,961 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 09:29:36,961 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 09:29:36,962 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2023-11-30 09:29:36,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][127], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 1176#true, 5#L72-2true, 381#(<= 1 ~counter~0), 978#true, 953#(<= 0 (+ ~N1~0 2147483648)), 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 507#true, 103#L58true, 2241#(<= ~N1~0 2147483647), 942#true, 127#(<= ~counter~0 1), 1579#(<= ~counter~0 1)]) [2023-11-30 09:29:36,965 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-30 09:29:36,965 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 09:29:36,965 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2023-11-30 09:29:36,965 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 09:29:37,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][385], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, 1176#true, thread1Thread1of1ForFork1NotInUse, 5#L72-2true, 381#(<= 1 ~counter~0), 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 953#(<= 0 (+ ~N1~0 2147483648)), 978#true, 1580#(<= ~counter~0 2), 255#(< ~counter~0 2147483647), 507#true, 103#L58true, 942#true, 2241#(<= ~N1~0 2147483647)]) [2023-11-30 09:29:37,742 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-30 09:29:37,742 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:37,742 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 09:29:37,742 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:37,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][384], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 1176#true, 5#L72-2true, 277#(< ~counter~0 2147483646), 978#true, 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 953#(<= 0 (+ ~N1~0 2147483648)), 507#true, 1580#(<= ~counter~0 2), 103#L58true, 2241#(<= ~N1~0 2147483647), 942#true, 409#(<= 0 ~counter~0)]) [2023-11-30 09:29:37,743 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-30 09:29:37,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:37,743 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 09:29:37,743 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:37,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][171], [113#true, 651#true, 970#(and (<= 0 ~N2~0) (<= 0 ~N1~0)), 117#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 1176#true, 5#L72-2true, 277#(< ~counter~0 2147483646), 381#(<= 1 ~counter~0), 978#true, 953#(<= 0 (+ ~N1~0 2147483648)), 2050#(and (<= 0 ~N2~0) (<= ~N1~0 2147483647) (<= 0 ~N1~0)), 507#true, 1580#(<= ~counter~0 2), 103#L58true, 2241#(<= ~N1~0 2147483647), 942#true]) [2023-11-30 09:29:37,745 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-30 09:29:37,745 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 09:29:37,745 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 09:29:37,745 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 09:29:38,985 INFO L124 PetriNetUnfolderBase]: 5537/14753 cut-off events. [2023-11-30 09:29:38,986 INFO L125 PetriNetUnfolderBase]: For 244364/248298 co-relation queries the response was YES. [2023-11-30 09:29:39,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111210 conditions, 14753 events. 5537/14753 cut-off events. For 244364/248298 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 145326 event pairs, 1812 based on Foata normal form. 200/12242 useless extension candidates. Maximal degree in co-relation 107695. Up to 8203 conditions per place. [2023-11-30 09:29:39,239 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 1710 selfloop transitions, 31 changer transitions 62/1888 dead transitions. [2023-11-30 09:29:39,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 1888 transitions, 54390 flow [2023-11-30 09:29:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-30 09:29:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-30 09:29:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1655 transitions. [2023-11-30 09:29:39,242 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6901584653878232 [2023-11-30 09:29:39,242 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1655 transitions. [2023-11-30 09:29:39,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1655 transitions. [2023-11-30 09:29:39,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:39,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1655 transitions. [2023-11-30 09:29:39,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 75.22727272727273) internal successors, (1655), 22 states have internal predecessors, (1655), 0 states have call successors, (0), 0 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 09:29:39,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 109.0) internal successors, (2507), 23 states have internal predecessors, (2507), 0 states have call successors, (0), 0 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 09:29:39,248 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 109.0) internal successors, (2507), 23 states have internal predecessors, (2507), 0 states have call successors, (0), 0 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 09:29:39,248 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 104 predicate places. [2023-11-30 09:29:39,248 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 1888 transitions, 54390 flow [2023-11-30 09:29:39,249 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 73.75) internal successors, (1180), 16 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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 09:29:39,249 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:39,249 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, 1, 1, 1, 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 09:29:39,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 09:29:39,453 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-30 09:29:39,454 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:39,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash 688905468, now seen corresponding path program 1 times [2023-11-30 09:29:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173899115] [2023-11-30 09:29:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:29:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173899115] [2023-11-30 09:29:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173899115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212313686] [2023-11-30 09:29:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:39,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:39,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:39,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 09:29:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:39,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:39,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:29:39,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:29:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212313686] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:39,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2023-11-30 09:29:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448349232] [2023-11-30 09:29:39,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:39,802 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-30 09:29:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:39,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-30 09:29:39,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-30 09:29:39,803 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 109 [2023-11-30 09:29:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1888 transitions, 54390 flow. Second operand has 17 states, 17 states have (on average 66.88235294117646) internal successors, (1137), 17 states have internal predecessors, (1137), 0 states have call successors, (0), 0 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 09:29:39,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:39,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 109 [2023-11-30 09:29:39,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:29:51,607 INFO L124 PetriNetUnfolderBase]: 11335/26267 cut-off events. [2023-11-30 09:29:51,607 INFO L125 PetriNetUnfolderBase]: For 344521/356611 co-relation queries the response was YES. [2023-11-30 09:29:51,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204394 conditions, 26267 events. 11335/26267 cut-off events. For 344521/356611 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 253243 event pairs, 3544 based on Foata normal form. 39/22909 useless extension candidates. Maximal degree in co-relation 168706. Up to 14425 conditions per place. [2023-11-30 09:29:51,852 INFO L140 encePairwiseOnDemand]: 93/109 looper letters, 2343 selfloop transitions, 60 changer transitions 519/2977 dead transitions. [2023-11-30 09:29:51,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 2977 transitions, 88001 flow [2023-11-30 09:29:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 09:29:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 09:29:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2064 transitions. [2023-11-30 09:29:51,860 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6311926605504588 [2023-11-30 09:29:51,860 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2064 transitions. [2023-11-30 09:29:51,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2064 transitions. [2023-11-30 09:29:51,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:29:51,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2064 transitions. [2023-11-30 09:29:51,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 68.8) internal successors, (2064), 30 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 09:29:51,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 109.0) internal successors, (3379), 31 states have internal predecessors, (3379), 0 states have call successors, (0), 0 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 09:29:51,878 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 109.0) internal successors, (3379), 31 states have internal predecessors, (3379), 0 states have call successors, (0), 0 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 09:29:51,879 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 132 predicate places. [2023-11-30 09:29:51,879 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 2977 transitions, 88001 flow [2023-11-30 09:29:51,880 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 66.88235294117646) internal successors, (1137), 17 states have internal predecessors, (1137), 0 states have call successors, (0), 0 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 09:29:51,880 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:29:51,880 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:29:51,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-30 09:29:52,085 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 09:29:52,086 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:29:52,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:29:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -288750332, now seen corresponding path program 2 times [2023-11-30 09:29:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:29:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184047740] [2023-11-30 09:29:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:29:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:29:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:29:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-30 09:29:52,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:29:52,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184047740] [2023-11-30 09:29:52,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184047740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:29:52,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898585492] [2023-11-30 09:29:52,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:29:52,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:29:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:29:52,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:29:52,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 09:29:52,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:29:52,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:29:52,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:29:52,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:29:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-30 09:29:52,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:29:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-30 09:29:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898585492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:29:52,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:29:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2023-11-30 09:29:52,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188554487] [2023-11-30 09:29:52,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:29:52,462 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 09:29:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:29:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 09:29:52,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-30 09:29:52,464 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 109 [2023-11-30 09:29:52,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 2977 transitions, 88001 flow. Second operand has 16 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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 09:29:52,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:29:52,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 109 [2023-11-30 09:29:52,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:30:11,414 INFO L124 PetriNetUnfolderBase]: 13514/30407 cut-off events. [2023-11-30 09:30:11,415 INFO L125 PetriNetUnfolderBase]: For 439876/454462 co-relation queries the response was YES. [2023-11-30 09:30:11,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257584 conditions, 30407 events. 13514/30407 cut-off events. For 439876/454462 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 289783 event pairs, 4496 based on Foata normal form. 301/26844 useless extension candidates. Maximal degree in co-relation 252771. Up to 17878 conditions per place. [2023-11-30 09:30:11,736 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 2003 selfloop transitions, 76 changer transitions 1251/3571 dead transitions. [2023-11-30 09:30:11,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 3571 transitions, 113605 flow [2023-11-30 09:30:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-30 09:30:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-30 09:30:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1674 transitions. [2023-11-30 09:30:11,739 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6980817347789825 [2023-11-30 09:30:11,739 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1674 transitions. [2023-11-30 09:30:11,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1674 transitions. [2023-11-30 09:30:11,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:30:11,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1674 transitions. [2023-11-30 09:30:11,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 76.0909090909091) internal successors, (1674), 22 states have internal predecessors, (1674), 0 states have call successors, (0), 0 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 09:30:11,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 109.0) internal successors, (2507), 23 states have internal predecessors, (2507), 0 states have call successors, (0), 0 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 09:30:11,743 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 109.0) internal successors, (2507), 23 states have internal predecessors, (2507), 0 states have call successors, (0), 0 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 09:30:11,743 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 152 predicate places. [2023-11-30 09:30:11,743 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 3571 transitions, 113605 flow [2023-11-30 09:30:11,744 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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 09:30:11,744 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:30:11,744 INFO L232 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:11,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-30 09:30:11,948 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 09:30:11,948 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:30:11,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:30:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 231935001, now seen corresponding path program 3 times [2023-11-30 09:30:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:30:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129985316] [2023-11-30 09:30:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:30:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:30:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:30:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:30:12,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:30:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129985316] [2023-11-30 09:30:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129985316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:30:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625641701] [2023-11-30 09:30:12,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:30:12,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:30:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:30:12,112 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:30:12,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 09:30:12,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-30 09:30:12,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:30:12,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-30 09:30:12,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:30:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:30:12,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:30:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:30:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625641701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:30:12,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:30:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-11-30 09:30:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743236712] [2023-11-30 09:30:12,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:30:12,536 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-30 09:30:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:30:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-30 09:30:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-30 09:30:12,538 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:30:12,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 3571 transitions, 113605 flow. Second operand has 25 states, 25 states have (on average 93.16) internal successors, (2329), 25 states have internal predecessors, (2329), 0 states have call successors, (0), 0 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 09:30:12,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:30:12,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:30:12,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:31:02,597 INFO L124 PetriNetUnfolderBase]: 37977/84411 cut-off events. [2023-11-30 09:31:02,597 INFO L125 PetriNetUnfolderBase]: For 1418607/1451261 co-relation queries the response was YES. [2023-11-30 09:31:03,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732858 conditions, 84411 events. 37977/84411 cut-off events. For 1418607/1451261 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 871149 event pairs, 13666 based on Foata normal form. 33/74301 useless extension candidates. Maximal degree in co-relation 596864. Up to 52484 conditions per place. [2023-11-30 09:31:03,568 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 555 selfloop transitions, 4508 changer transitions 3580/9037 dead transitions. [2023-11-30 09:31:03,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 9037 transitions, 321786 flow [2023-11-30 09:31:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 09:31:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 09:31:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2371 transitions. [2023-11-30 09:31:03,570 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9063455657492355 [2023-11-30 09:31:03,570 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2371 transitions. [2023-11-30 09:31:03,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2371 transitions. [2023-11-30 09:31:03,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:31:03,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2371 transitions. [2023-11-30 09:31:03,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 98.79166666666667) internal successors, (2371), 24 states have internal predecessors, (2371), 0 states have call successors, (0), 0 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 09:31:03,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 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 09:31:03,575 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 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 09:31:03,576 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 175 predicate places. [2023-11-30 09:31:03,576 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 9037 transitions, 321786 flow [2023-11-30 09:31:03,576 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 93.16) internal successors, (2329), 25 states have internal predecessors, (2329), 0 states have call successors, (0), 0 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 09:31:03,576 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:31:03,576 INFO L232 CegarLoopForPetriNet]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:03,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-30 09:31:03,780 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 09:31:03,781 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:31:03,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:31:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1588709849, now seen corresponding path program 4 times [2023-11-30 09:31:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:31:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249047815] [2023-11-30 09:31:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:31:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:31:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:31:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:31:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:31:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249047815] [2023-11-30 09:31:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249047815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:31:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097629941] [2023-11-30 09:31:04,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 09:31:04,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:31:04,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:31:04,192 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:31:04,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-30 09:31:04,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 09:31:04,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:31:04,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-30 09:31:04,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:31:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:31:04,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:31:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:31:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097629941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:31:05,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:31:05,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2023-11-30 09:31:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506720953] [2023-11-30 09:31:05,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:31:05,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-30 09:31:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:31:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-30 09:31:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-30 09:31:05,169 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:31:05,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 9037 transitions, 321786 flow. Second operand has 49 states, 49 states have (on average 93.08163265306122) internal successors, (4561), 49 states have internal predecessors, (4561), 0 states have call successors, (0), 0 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 09:31:05,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:31:05,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:31:05,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:37:14,669 INFO L124 PetriNetUnfolderBase]: 99002/220329 cut-off events. [2023-11-30 09:37:14,669 INFO L125 PetriNetUnfolderBase]: For 4232744/4313543 co-relation queries the response was YES. [2023-11-30 09:37:15,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951324 conditions, 220329 events. 99002/220329 cut-off events. For 4232744/4313543 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 2393536 event pairs, 37792 based on Foata normal form. 27/194391 useless extension candidates. Maximal degree in co-relation 1921235. Up to 141516 conditions per place. [2023-11-30 09:37:17,794 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 675 selfloop transitions, 12517 changer transitions 9707/23293 dead transitions. [2023-11-30 09:37:17,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 23293 transitions, 894563 flow [2023-11-30 09:37:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 09:37:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 09:37:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4747 transitions. [2023-11-30 09:37:17,798 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9073012232415902 [2023-11-30 09:37:17,799 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 4747 transitions. [2023-11-30 09:37:17,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 4747 transitions. [2023-11-30 09:37:17,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:37:17,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 4747 transitions. [2023-11-30 09:37:17,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 98.89583333333333) internal successors, (4747), 48 states have internal predecessors, (4747), 0 states have call successors, (0), 0 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 09:37:17,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 109.0) internal successors, (5341), 49 states have internal predecessors, (5341), 0 states have call successors, (0), 0 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 09:37:17,813 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 109.0) internal successors, (5341), 49 states have internal predecessors, (5341), 0 states have call successors, (0), 0 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 09:37:17,814 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, 222 predicate places. [2023-11-30 09:37:17,814 INFO L500 AbstractCegarLoop]: Abstraction has has 310 places, 23293 transitions, 894563 flow [2023-11-30 09:37:17,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 93.08163265306122) internal successors, (4561), 49 states have internal predecessors, (4561), 0 states have call successors, (0), 0 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 09:37:17,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:37:17,815 INFO L232 CegarLoopForPetriNet]: trace histogram [47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:17,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-30 09:37:18,019 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 09:37:18,020 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-11-30 09:37:18,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:37:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 668738905, now seen corresponding path program 5 times [2023-11-30 09:37:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:37:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800032993] [2023-11-30 09:37:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:37:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:37:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:37:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:37:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:37:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800032993] [2023-11-30 09:37:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800032993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:37:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845484216] [2023-11-30 09:37:19,376 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 09:37:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:37:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:37:19,388 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:37:19,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-30 09:37:19,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-11-30 09:37:19,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:37:19,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-30 09:37:19,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:37:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:37:19,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:37:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:37:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845484216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:37:22,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:37:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2023-11-30 09:37:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984935327] [2023-11-30 09:37:22,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:37:22,002 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-11-30 09:37:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:37:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-30 09:37:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-30 09:37:22,008 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 109 [2023-11-30 09:37:22,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 23293 transitions, 894563 flow. Second operand has 97 states, 97 states have (on average 93.04123711340206) internal successors, (9025), 97 states have internal predecessors, (9025), 0 states have call successors, (0), 0 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 09:37:22,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:37:22,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 109 [2023-11-30 09:37:22,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 09:42:48,607 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 09:42:48,616 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 09:42:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 09:42:48,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2023-11-30 09:42:48,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-30 09:42:49,137 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:42:49,138 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2023-11-30 09:42:49,139 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2023-11-30 09:42:49,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2023-11-30 09:42:49,141 INFO L457 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:42:49,144 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 09:42:49,144 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 09:42:49,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 09:42:49 BasicIcfg [2023-11-30 09:42:49,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 09:42:49,147 INFO L158 Benchmark]: Toolchain (without parser) took 811504.18ms. Allocated memory was 377.5MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 343.7MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. [2023-11-30 09:42:49,147 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 333.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 09:42:49,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 377.5MB. Free memory was 343.3MB in the beginning and 331.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 09:42:49,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.39ms. Allocated memory is still 377.5MB. Free memory was 331.7MB in the beginning and 330.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 09:42:49,147 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 377.5MB. Free memory was 330.0MB in the beginning and 328.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 09:42:49,147 INFO L158 Benchmark]: RCFGBuilder took 372.73ms. Allocated memory is still 377.5MB. Free memory was 328.7MB in the beginning and 310.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-30 09:42:49,148 INFO L158 Benchmark]: TraceAbstraction took 810867.16ms. Allocated memory was 377.5MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 310.2MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. [2023-11-30 09:42:49,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 333.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 377.5MB. Free memory was 343.3MB in the beginning and 331.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.39ms. Allocated memory is still 377.5MB. Free memory was 331.7MB in the beginning and 330.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 377.5MB. Free memory was 330.0MB in the beginning and 328.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 372.73ms. Allocated memory is still 377.5MB. Free memory was 328.7MB in the beginning and 310.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 810867.16ms. Allocated memory was 377.5MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 310.2MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 92/109 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 433457 conditions, 49401 events (21232/49400 cut-off events. For 1061127/1081831 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 535049 event pairs, 7766 based on Foata normal form. 8/44586 useless extension candidates. Maximal degree in co-relation 425598. Up to 28658 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 140 locations, 20 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 810.8s, OverallIterations: 19, TraceHistogramMax: 47, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 798.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1952 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1952 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 108 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2698 GetRequests, 2311 SyntacticMatches, 6 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=894563occurred in iteration=18, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2872 NumberOfCodeBlocks, 2782 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 3934 ConstructedInterpolants, 0 QuantifiedInterpolants, 11230 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2669 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 43 InterpolantComputations, 9 PerfectInterpolantSequences, 357/28745 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown