./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/clever.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:39:33,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:39:33,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:39:33,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:39:33,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:39:33,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:39:33,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:39:33,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:39:33,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:39:33,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:39:33,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:39:33,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:39:33,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:39:33,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:39:33,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:39:33,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:39:33,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:39:33,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:39:33,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:39:33,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:39:33,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:39:33,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:39:33,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2025-03-09 06:39:33,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:39:33,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:39:34,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:39:34,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:39:34,001 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:39:34,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/clever.wvr.c [2025-03-09 06:39:35,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f70b74bd/7dd7e3f281a34737800aa112a0713612/FLAG45683bf36 [2025-03-09 06:39:35,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:39:35,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2025-03-09 06:39:35,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f70b74bd/7dd7e3f281a34737800aa112a0713612/FLAG45683bf36 [2025-03-09 06:39:35,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f70b74bd/7dd7e3f281a34737800aa112a0713612 [2025-03-09 06:39:35,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:39:35,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:39:35,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:39:35,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:39:35,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:39:35,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ed193a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35, skipping insertion in model container [2025-03-09 06:39:35,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:39:35,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:39:35,913 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:39:35,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:39:35,944 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:39:35,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35 WrapperNode [2025-03-09 06:39:35,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:39:35,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:39:35,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:39:35,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:39:35,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,971 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-03-09 06:39:35,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:39:35,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:39:35,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:39:35,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:39:35,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:35,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 06:39:36,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:39:36,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:39:36,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:39:36,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:39:36,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (1/1) ... [2025-03-09 06:39:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:39:36,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:36,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:39:36,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:39:36,065 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:39:36,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:39:36,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:39:36,321 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:39:36,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:39:36,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:39:36,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:39:36,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:36 BoogieIcfgContainer [2025-03-09 06:39:36,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:39:36,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:39:36,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:39:36,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:39:36,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:39:35" (1/3) ... [2025-03-09 06:39:36,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:39:36, skipping insertion in model container [2025-03-09 06:39:36,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:35" (2/3) ... [2025-03-09 06:39:36,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:39:36, skipping insertion in model container [2025-03-09 06:39:36,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:36" (3/3) ... [2025-03-09 06:39:36,514 INFO L128 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2025-03-09 06:39:36,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:39:36,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clever.wvr.c that has 3 procedures, 28 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-09 06:39:36,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:39:36,571 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:39:36,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 74 flow [2025-03-09 06:39:36,629 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-03-09 06:39:36,631 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:39:36,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 3/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 63 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-09 06:39:36,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 74 flow [2025-03-09 06:39:36,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 61 flow [2025-03-09 06:39:36,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:39:36,657 INFO L333 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, 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;@e142caf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:39:36,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 06:39:36,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:39:36,666 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-03-09 06:39:36,667 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:39:36,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:36,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:39:36,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -568690934, now seen corresponding path program 1 times [2025-03-09 06:39:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165799056] [2025-03-09 06:39:36,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:39:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:39:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165799056] [2025-03-09 06:39:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165799056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642082949] [2025-03-09 06:39:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:36,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:36,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:36,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:36,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:36,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:36,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:36,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:36,999 INFO L124 PetriNetUnfolderBase]: 126/234 cut-off events. [2025-03-09 06:39:36,999 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 06:39:37,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 234 events. 126/234 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 959 event pairs, 47 based on Foata normal form. 10/164 useless extension candidates. Maximal degree in co-relation 423. Up to 146 conditions per place. [2025-03-09 06:39:37,005 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-09 06:39:37,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 118 flow [2025-03-09 06:39:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-09 06:39:37,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-03-09 06:39:37,020 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 61 flow. Second operand 4 states and 67 transitions. [2025-03-09 06:39:37,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 118 flow [2025-03-09 06:39:37,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:37,026 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 60 flow [2025-03-09 06:39:37,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-09 06:39:37,033 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-09 06:39:37,033 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 60 flow [2025-03-09 06:39:37,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:39:37,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:37,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash -568690901, now seen corresponding path program 1 times [2025-03-09 06:39:37,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264122887] [2025-03-09 06:39:37,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:39:37,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:39:37,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264122887] [2025-03-09 06:39:37,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264122887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:37,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:37,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497310964] [2025-03-09 06:39:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:37,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:37,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:37,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:37,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,237 INFO L124 PetriNetUnfolderBase]: 237/437 cut-off events. [2025-03-09 06:39:37,237 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 06:39:37,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 437 events. 237/437 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2032 event pairs, 85 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 460. Up to 216 conditions per place. [2025-03-09 06:39:37,244 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-09 06:39:37,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 179 flow [2025-03-09 06:39:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-09 06:39:37,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 06:39:37,245 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 60 flow. Second operand 4 states and 82 transitions. [2025-03-09 06:39:37,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 179 flow [2025-03-09 06:39:37,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 169 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:37,247 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 82 flow [2025-03-09 06:39:37,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2025-03-09 06:39:37,248 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-03-09 06:39:37,248 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 82 flow [2025-03-09 06:39:37,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:39:37,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:37,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -449549537, now seen corresponding path program 1 times [2025-03-09 06:39:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128372478] [2025-03-09 06:39:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:39:37,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:39:37,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128372478] [2025-03-09 06:39:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128372478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589238841] [2025-03-09 06:39:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:37,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:37,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:37,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:37,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,438 INFO L124 PetriNetUnfolderBase]: 366/697 cut-off events. [2025-03-09 06:39:37,438 INFO L125 PetriNetUnfolderBase]: For 157/161 co-relation queries the response was YES. [2025-03-09 06:39:37,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 697 events. 366/697 cut-off events. For 157/161 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3580 event pairs, 60 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1116. Up to 371 conditions per place. [2025-03-09 06:39:37,443 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 37 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-09 06:39:37,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 225 flow [2025-03-09 06:39:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-09 06:39:37,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:39:37,445 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 82 flow. Second operand 4 states and 80 transitions. [2025-03-09 06:39:37,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 225 flow [2025-03-09 06:39:37,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:39:37,447 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 102 flow [2025-03-09 06:39:37,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-09 06:39:37,447 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-03-09 06:39:37,448 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 102 flow [2025-03-09 06:39:37,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:39:37,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -451684592, now seen corresponding path program 1 times [2025-03-09 06:39:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480482755] [2025-03-09 06:39:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:39:37,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:39:37,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480482755] [2025-03-09 06:39:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480482755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357832716] [2025-03-09 06:39:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:37,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:37,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:37,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:37,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,593 INFO L124 PetriNetUnfolderBase]: 399/771 cut-off events. [2025-03-09 06:39:37,593 INFO L125 PetriNetUnfolderBase]: For 351/367 co-relation queries the response was YES. [2025-03-09 06:39:37,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 771 events. 399/771 cut-off events. For 351/367 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3989 event pairs, 154 based on Foata normal form. 39/688 useless extension candidates. Maximal degree in co-relation 1387. Up to 384 conditions per place. [2025-03-09 06:39:37,598 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 31 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-09 06:39:37,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 224 flow [2025-03-09 06:39:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-09 06:39:37,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-09 06:39:37,599 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 102 flow. Second operand 4 states and 69 transitions. [2025-03-09 06:39:37,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 224 flow [2025-03-09 06:39:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:37,602 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 104 flow [2025-03-09 06:39:37,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-03-09 06:39:37,603 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-03-09 06:39:37,603 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 104 flow [2025-03-09 06:39:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:39:37,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1117320222, now seen corresponding path program 1 times [2025-03-09 06:39:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194436587] [2025-03-09 06:39:37,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:39:37,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:39:37,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194436587] [2025-03-09 06:39:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194436587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514579087] [2025-03-09 06:39:37,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:37,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:37,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:37,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:37,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:37,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,769 INFO L124 PetriNetUnfolderBase]: 500/970 cut-off events. [2025-03-09 06:39:37,769 INFO L125 PetriNetUnfolderBase]: For 633/685 co-relation queries the response was YES. [2025-03-09 06:39:37,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 970 events. 500/970 cut-off events. For 633/685 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5270 event pairs, 106 based on Foata normal form. 39/999 useless extension candidates. Maximal degree in co-relation 1917. Up to 456 conditions per place. [2025-03-09 06:39:37,774 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 47 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-09 06:39:37,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 324 flow [2025-03-09 06:39:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-09 06:39:37,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:39:37,776 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 104 flow. Second operand 4 states and 80 transitions. [2025-03-09 06:39:37,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 324 flow [2025-03-09 06:39:37,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:37,780 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 118 flow [2025-03-09 06:39:37,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-03-09 06:39:37,781 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-03-09 06:39:37,781 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 118 flow [2025-03-09 06:39:37,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:39:37,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1775586117, now seen corresponding path program 1 times [2025-03-09 06:39:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108985309] [2025-03-09 06:39:37,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:39:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:39:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108985309] [2025-03-09 06:39:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108985309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787571182] [2025-03-09 06:39:37,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:37,851 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) [2025-03-09 06:39:37,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:39:37,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:39:37,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:39:37,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:37,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:39:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787571182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:39:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:39:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978924614] [2025-03-09 06:39:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:39:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:39:37,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:39:37,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:37,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:37,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:38,081 INFO L124 PetriNetUnfolderBase]: 475/929 cut-off events. [2025-03-09 06:39:38,081 INFO L125 PetriNetUnfolderBase]: For 524/560 co-relation queries the response was YES. [2025-03-09 06:39:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 929 events. 475/929 cut-off events. For 524/560 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5162 event pairs, 28 based on Foata normal form. 28/927 useless extension candidates. Maximal degree in co-relation 2049. Up to 258 conditions per place. [2025-03-09 06:39:38,086 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-09 06:39:38,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 392 flow [2025-03-09 06:39:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:39:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:39:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-09 06:39:38,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 06:39:38,087 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 118 flow. Second operand 6 states and 117 transitions. [2025-03-09 06:39:38,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 392 flow [2025-03-09 06:39:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:38,090 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 130 flow [2025-03-09 06:39:38,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2025-03-09 06:39:38,091 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-03-09 06:39:38,091 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 130 flow [2025-03-09 06:39:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:38,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:38,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:38,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 06:39:38,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -791404986, now seen corresponding path program 1 times [2025-03-09 06:39:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971835541] [2025-03-09 06:39:38,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:39:38,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:39:38,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971835541] [2025-03-09 06:39:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971835541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663952681] [2025-03-09 06:39:38,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:38,362 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) [2025-03-09 06:39:38,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:39:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:39:38,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:39:38,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:38,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:38,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663952681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:38,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 06:39:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185545477] [2025-03-09 06:39:38,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:38,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:39:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:39:38,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:39:38,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:38,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 130 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:38,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:38,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:38,805 INFO L124 PetriNetUnfolderBase]: 1057/2087 cut-off events. [2025-03-09 06:39:38,805 INFO L125 PetriNetUnfolderBase]: For 1799/1874 co-relation queries the response was YES. [2025-03-09 06:39:38,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 2087 events. 1057/2087 cut-off events. For 1799/1874 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12802 event pairs, 213 based on Foata normal form. 84/2167 useless extension candidates. Maximal degree in co-relation 3767. Up to 463 conditions per place. [2025-03-09 06:39:38,821 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 108 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-03-09 06:39:38,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 128 transitions, 748 flow [2025-03-09 06:39:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:39:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:39:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2025-03-09 06:39:38,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 06:39:38,824 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 130 flow. Second operand 10 states and 205 transitions. [2025-03-09 06:39:38,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 128 transitions, 748 flow [2025-03-09 06:39:38,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 128 transitions, 720 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 06:39:38,834 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 204 flow [2025-03-09 06:39:38,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-03-09 06:39:38,836 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-09 06:39:38,837 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 204 flow [2025-03-09 06:39:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:38,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:39:38,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:39:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 06:39:39,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 289576837, now seen corresponding path program 1 times [2025-03-09 06:39:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076674602] [2025-03-09 06:39:39,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:39,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:39,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:39,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076674602] [2025-03-09 06:39:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076674602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913366232] [2025-03-09 06:39:39,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:39,099 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) [2025-03-09 06:39:39,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:39:39,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:39,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:39,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:39,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:39,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:39:39,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913366232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:39,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-09 06:39:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114752743] [2025-03-09 06:39:39,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:39:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:39:39,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:39:39,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:39,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 204 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:39,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:39,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:39,557 INFO L124 PetriNetUnfolderBase]: 1847/3511 cut-off events. [2025-03-09 06:39:39,557 INFO L125 PetriNetUnfolderBase]: For 3289/3436 co-relation queries the response was YES. [2025-03-09 06:39:39,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9989 conditions, 3511 events. 1847/3511 cut-off events. For 3289/3436 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22681 event pairs, 208 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 8503. Up to 880 conditions per place. [2025-03-09 06:39:39,574 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 106 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-03-09 06:39:39,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 845 flow [2025-03-09 06:39:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:39:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:39:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2025-03-09 06:39:39,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6259259259259259 [2025-03-09 06:39:39,577 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 204 flow. Second operand 9 states and 169 transitions. [2025-03-09 06:39:39,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 845 flow [2025-03-09 06:39:39,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 125 transitions, 805 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:39,587 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 262 flow [2025-03-09 06:39:39,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-03-09 06:39:39,589 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-03-09 06:39:39,590 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 262 flow [2025-03-09 06:39:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:39,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:39,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:39,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:39,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:39,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:39,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash -89892628, now seen corresponding path program 1 times [2025-03-09 06:39:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:39,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002628598] [2025-03-09 06:39:39,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:39,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:39,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002628598] [2025-03-09 06:39:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002628598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591457754] [2025-03-09 06:39:39,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:39,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:39,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:39,859 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) [2025-03-09 06:39:39,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:39:39,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:39,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:39,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:39,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:39,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:39:39,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591457754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:39,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:39,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 2] total 6 [2025-03-09 06:39:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293774939] [2025-03-09 06:39:39,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:39:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:39:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:39:39,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:40,335 INFO L124 PetriNetUnfolderBase]: 2678/5069 cut-off events. [2025-03-09 06:39:40,335 INFO L125 PetriNetUnfolderBase]: For 7106/7142 co-relation queries the response was YES. [2025-03-09 06:39:40,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14586 conditions, 5069 events. 2678/5069 cut-off events. For 7106/7142 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34815 event pairs, 473 based on Foata normal form. 0/5059 useless extension candidates. Maximal degree in co-relation 12967. Up to 1064 conditions per place. [2025-03-09 06:39:40,361 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 174 selfloop transitions, 7 changer transitions 12/199 dead transitions. [2025-03-09 06:39:40,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 199 transitions, 1661 flow [2025-03-09 06:39:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:39:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:39:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2025-03-09 06:39:40,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2025-03-09 06:39:40,362 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 262 flow. Second operand 8 states and 151 transitions. [2025-03-09 06:39:40,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 199 transitions, 1661 flow [2025-03-09 06:39:40,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 199 transitions, 1574 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-03-09 06:39:40,373 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 258 flow [2025-03-09 06:39:40,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-09 06:39:40,373 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-03-09 06:39:40,373 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 258 flow [2025-03-09 06:39:40,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:40,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:40,374 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-09 06:39:40,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:39:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:40,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 06:39:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2147257248, now seen corresponding path program 2 times [2025-03-09 06:39:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801588699] [2025-03-09 06:39:40,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:40,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:39:40,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 06:39:40,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:40,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801588699] [2025-03-09 06:39:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801588699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781499679] [2025-03-09 06:39:40,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:40,616 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) [2025-03-09 06:39:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:39:40,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:39:40,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 06:39:40,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:40,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:40,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:39:40,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:40,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:40,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781499679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:40,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:40,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-09 06:39:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562342935] [2025-03-09 06:39:40,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:40,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:40,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:40,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:40,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-09 06:39:40,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:40,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:40,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-09 06:39:40,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:40,895 INFO L124 PetriNetUnfolderBase]: 2070/3934 cut-off events. [2025-03-09 06:39:40,895 INFO L125 PetriNetUnfolderBase]: For 6018/6018 co-relation queries the response was YES. [2025-03-09 06:39:40,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11969 conditions, 3934 events. 2070/3934 cut-off events. For 6018/6018 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 26003 event pairs, 1223 based on Foata normal form. 60/3981 useless extension candidates. Maximal degree in co-relation 10758. Up to 2556 conditions per place. [2025-03-09 06:39:40,904 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-03-09 06:39:40,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 394 flow [2025-03-09 06:39:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-09 06:39:40,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 06:39:40,905 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 258 flow. Second operand 4 states and 64 transitions. [2025-03-09 06:39:40,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 394 flow [2025-03-09 06:39:40,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 353 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-09 06:39:40,914 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-03-09 06:39:40,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2025-03-09 06:39:40,914 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2025-03-09 06:39:40,914 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-03-09 06:39:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-09 06:39:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-09 06:39:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-09 06:39:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-09 06:39:40,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-09 06:39:40,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-09 06:39:40,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 06:39:41,122 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:41,125 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:39:41,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:39:41,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:39:41 BasicIcfg [2025-03-09 06:39:41,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:39:41,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:39:41,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:39:41,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:39:41,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:36" (3/4) ... [2025-03-09 06:39:41,131 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:39:41,132 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 06:39:41,132 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 06:39:41,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-09 06:39:41,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-09 06:39:41,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 06:39:41,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 06:39:41,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:39:41,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:39:41,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:39:41,182 INFO L158 Benchmark]: Toolchain (without parser) took 5426.64ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.9MB in the beginning and 100.6MB in the end (delta: 11.3MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.23ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 100.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.37ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 980.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: IcfgBuilder took 490.77ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 67.3MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: TraceAbstraction took 4622.08ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 105.5MB in the end (delta: -39.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,182 INFO L158 Benchmark]: Witness Printer took 51.74ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 100.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:39:41,184 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.23ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 100.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.37ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 980.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 490.77ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 67.3MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4622.08ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 105.5MB in the end (delta: -39.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Witness Printer took 51.74ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 100.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 54 edges, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 13 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 72/124 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:39:41,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE