./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/systemc/token_ring.01.cil-1.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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:50:04,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:50:05,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:50:05,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:50:05,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:50:05,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:50:05,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:50:05,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:50:05,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:50:05,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:50:05,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:50:05,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:50:05,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:50:05,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:50:05,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:50:05,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:50:05,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:50:05,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:50:05,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:50:05,034 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2025-03-17 15:50:05,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:50:05,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:50:05,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:50:05,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:50:05,280 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:50:05,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-03-17 15:50:06,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e63fd575/b89e1a3d3ece492787e42f365520e1eb/FLAG1644fd8ed [2025-03-17 15:50:06,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:50:06,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-03-17 15:50:06,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e63fd575/b89e1a3d3ece492787e42f365520e1eb/FLAG1644fd8ed [2025-03-17 15:50:06,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e63fd575/b89e1a3d3ece492787e42f365520e1eb [2025-03-17 15:50:06,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:50:06,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:50:06,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:50:06,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:50:06,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:50:06,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:06" (1/1) ... [2025-03-17 15:50:06,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc0b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:06, skipping insertion in model container [2025-03-17 15:50:06,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:06" (1/1) ... [2025-03-17 15:50:06,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:50:07,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:50:07,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:50:07,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:50:07,154 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:50:07,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07 WrapperNode [2025-03-17 15:50:07,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:50:07,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:50:07,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:50:07,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:50:07,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,185 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2025-03-17 15:50:07,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:50:07,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:50:07,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:50:07,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:50:07,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,208 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-17 15:50:07,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:50:07,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:50:07,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:50:07,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:50:07,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (1/1) ... [2025-03-17 15:50:07,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:50:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:07,245 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-17 15:50:07,247 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-17 15:50:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:50:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-17 15:50:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-17 15:50:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-17 15:50:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-17 15:50:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-17 15:50:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-17 15:50:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-17 15:50:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-17 15:50:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-17 15:50:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-17 15:50:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:50:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-17 15:50:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-17 15:50:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:50:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:50:07,310 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:50:07,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:50:07,537 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 15:50:07,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:50:07,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:50:07,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:50:07,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:07 BoogieIcfgContainer [2025-03-17 15:50:07,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:50:07,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:50:07,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:50:07,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:50:07,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:50:06" (1/3) ... [2025-03-17 15:50:07,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a4a21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:07, skipping insertion in model container [2025-03-17 15:50:07,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:07" (2/3) ... [2025-03-17 15:50:07,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a4a21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:07, skipping insertion in model container [2025-03-17 15:50:07,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:07" (3/3) ... [2025-03-17 15:50:07,558 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2025-03-17 15:50:07,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:50:07,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-1.c that has 7 procedures, 102 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2025-03-17 15:50:07,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:50:07,613 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;@3a2700c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:50:07,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:50:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 81 states have internal predecessors, (119), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:50:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:07,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:07,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:07,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1811047033, now seen corresponding path program 1 times [2025-03-17 15:50:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912943186] [2025-03-17 15:50:07,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:07,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:07,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:07,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:07,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:07,789 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-17 15:50:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912943186] [2025-03-17 15:50:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912943186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642165605] [2025-03-17 15:50:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:07,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:07,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:07,812 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 81 states have internal predecessors, (119), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:07,845 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2025-03-17 15:50:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:07,854 INFO L225 Difference]: With dead ends: 199 [2025-03-17 15:50:07,854 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 15:50:07,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:07,861 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:07,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 142 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 15:50:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 15:50:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 78 states have internal predecessors, (110), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:50:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2025-03-17 15:50:07,902 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 49 [2025-03-17 15:50:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:07,904 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2025-03-17 15:50:07,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2025-03-17 15:50:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:07,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:07,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:07,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:50:07,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1362350394, now seen corresponding path program 1 times [2025-03-17 15:50:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801005945] [2025-03-17 15:50:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:07,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:07,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,056 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-17 15:50:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801005945] [2025-03-17 15:50:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801005945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534770372] [2025-03-17 15:50:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:08,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:08,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:08,059 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:08,319 INFO L93 Difference]: Finished difference Result 288 states and 411 transitions. [2025-03-17 15:50:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:08,322 INFO L225 Difference]: With dead ends: 288 [2025-03-17 15:50:08,322 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 15:50:08,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:08,323 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 212 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:08,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 358 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 15:50:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2025-03-17 15:50:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 150 states have internal predecessors, (216), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-17 15:50:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 267 transitions. [2025-03-17 15:50:08,351 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 267 transitions. Word has length 49 [2025-03-17 15:50:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 267 transitions. [2025-03-17 15:50:08,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 267 transitions. [2025-03-17 15:50:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:08,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:08,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:08,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:50:08,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:08,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -309594620, now seen corresponding path program 1 times [2025-03-17 15:50:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245245178] [2025-03-17 15:50:08,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:08,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:08,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,481 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-17 15:50:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245245178] [2025-03-17 15:50:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245245178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286469818] [2025-03-17 15:50:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:08,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:08,483 INFO L87 Difference]: Start difference. First operand 187 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:08,772 INFO L93 Difference]: Finished difference Result 475 states and 678 transitions. [2025-03-17 15:50:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:08,775 INFO L225 Difference]: With dead ends: 475 [2025-03-17 15:50:08,775 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 15:50:08,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:08,776 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 200 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 654 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 15:50:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 270. [2025-03-17 15:50:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 211 states have (on average 1.4786729857819905) internal successors, (312), 217 states have internal predecessors, (312), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-17 15:50:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 386 transitions. [2025-03-17 15:50:08,813 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 386 transitions. Word has length 49 [2025-03-17 15:50:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:08,813 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 386 transitions. [2025-03-17 15:50:08,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2025-03-17 15:50:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:08,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:08,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:08,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:50:08,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:08,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1232278203, now seen corresponding path program 1 times [2025-03-17 15:50:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591507949] [2025-03-17 15:50:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:08,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:08,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:08,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,884 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-17 15:50:08,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:08,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591507949] [2025-03-17 15:50:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591507949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:08,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:08,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628662088] [2025-03-17 15:50:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:08,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:08,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:08,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:08,885 INFO L87 Difference]: Start difference. First operand 270 states and 386 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,155 INFO L93 Difference]: Finished difference Result 748 states and 1071 transitions. [2025-03-17 15:50:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,159 INFO L225 Difference]: With dead ends: 748 [2025-03-17 15:50:09,159 INFO L226 Difference]: Without dead ends: 485 [2025-03-17 15:50:09,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:09,160 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 233 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 625 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-17 15:50:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 433. [2025-03-17 15:50:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 340 states have (on average 1.4617647058823529) internal successors, (497), 350 states have internal predecessors, (497), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-03-17 15:50:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2025-03-17 15:50:09,209 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 49 [2025-03-17 15:50:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2025-03-17 15:50:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2025-03-17 15:50:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:09,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:50:09,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash 400525796, now seen corresponding path program 1 times [2025-03-17 15:50:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638376746] [2025-03-17 15:50:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:09,268 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-17 15:50:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638376746] [2025-03-17 15:50:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638376746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63243166] [2025-03-17 15:50:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:09,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:09,270 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,549 INFO L93 Difference]: Finished difference Result 1227 states and 1766 transitions. [2025-03-17 15:50:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,556 INFO L225 Difference]: With dead ends: 1227 [2025-03-17 15:50:09,556 INFO L226 Difference]: Without dead ends: 801 [2025-03-17 15:50:09,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:09,557 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 200 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 609 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-17 15:50:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 734. [2025-03-17 15:50:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 573 states have (on average 1.4397905759162304) internal successors, (825), 597 states have internal predecessors, (825), 85 states have call successors, (85), 52 states have call predecessors, (85), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2025-03-17 15:50:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1059 transitions. [2025-03-17 15:50:09,627 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1059 transitions. Word has length 49 [2025-03-17 15:50:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,627 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1059 transitions. [2025-03-17 15:50:09,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1059 transitions. [2025-03-17 15:50:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:09,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:50:09,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:09,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 730291557, now seen corresponding path program 1 times [2025-03-17 15:50:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-17 15:50:09,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:09,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:09,673 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-17 15:50:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-17 15:50:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722650799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340893531] [2025-03-17 15:50:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:09,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:09,674 INFO L87 Difference]: Start difference. First operand 734 states and 1059 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,831 INFO L93 Difference]: Finished difference Result 1866 states and 2722 transitions. [2025-03-17 15:50:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-17 15:50:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,838 INFO L225 Difference]: With dead ends: 1866 [2025-03-17 15:50:09,838 INFO L226 Difference]: Without dead ends: 1140 [2025-03-17 15:50:09,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:09,841 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 232 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 437 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-17 15:50:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1115. [2025-03-17 15:50:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 869 states have (on average 1.4085155350978136) internal successors, (1224), 904 states have internal predecessors, (1224), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2025-03-17 15:50:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1569 transitions. [2025-03-17 15:50:09,910 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1569 transitions. Word has length 49 [2025-03-17 15:50:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,911 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1569 transitions. [2025-03-17 15:50:09,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1569 transitions. [2025-03-17 15:50:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:50:09,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:50:09,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:09,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1285674537, now seen corresponding path program 1 times [2025-03-17 15:50:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271335516] [2025-03-17 15:50:09,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:50:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:50:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:09,953 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-17 15:50:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271335516] [2025-03-17 15:50:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271335516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238899713] [2025-03-17 15:50:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:09,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:09,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:09,955 INFO L87 Difference]: Start difference. First operand 1115 states and 1569 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:10,040 INFO L93 Difference]: Finished difference Result 2232 states and 3188 transitions. [2025-03-17 15:50:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-17 15:50:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:10,046 INFO L225 Difference]: With dead ends: 2232 [2025-03-17 15:50:10,046 INFO L226 Difference]: Without dead ends: 1125 [2025-03-17 15:50:10,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:10,050 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:10,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-17 15:50:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2025-03-17 15:50:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 879 states have (on average 1.3936291240045506) internal successors, (1225), 914 states have internal predecessors, (1225), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2025-03-17 15:50:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1570 transitions. [2025-03-17 15:50:10,131 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1570 transitions. Word has length 50 [2025-03-17 15:50:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:10,132 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1570 transitions. [2025-03-17 15:50:10,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1570 transitions. [2025-03-17 15:50:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:50:10,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:10,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:10,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:50:10,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:10,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1274358410, now seen corresponding path program 1 times [2025-03-17 15:50:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500600512] [2025-03-17 15:50:10,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:10,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:50:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:50:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:10,188 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-17 15:50:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500600512] [2025-03-17 15:50:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500600512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491385738] [2025-03-17 15:50:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:10,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:10,190 INFO L87 Difference]: Start difference. First operand 1125 states and 1570 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:10,490 INFO L93 Difference]: Finished difference Result 3652 states and 5105 transitions. [2025-03-17 15:50:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-17 15:50:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:10,500 INFO L225 Difference]: With dead ends: 3652 [2025-03-17 15:50:10,501 INFO L226 Difference]: Without dead ends: 2443 [2025-03-17 15:50:10,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:10,505 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 438 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:10,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 505 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-03-17 15:50:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2238. [2025-03-17 15:50:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1753 states have (on average 1.3839132915002852) internal successors, (2426), 1822 states have internal predecessors, (2426), 259 states have call successors, (259), 165 states have call predecessors, (259), 222 states have return successors, (417), 258 states have call predecessors, (417), 259 states have call successors, (417) [2025-03-17 15:50:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3102 transitions. [2025-03-17 15:50:10,634 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3102 transitions. Word has length 50 [2025-03-17 15:50:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:10,634 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3102 transitions. [2025-03-17 15:50:10,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3102 transitions. [2025-03-17 15:50:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:10,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:10,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:10,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:50:10,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1525711139, now seen corresponding path program 1 times [2025-03-17 15:50:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859240091] [2025-03-17 15:50:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:10,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:10,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:10,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859240091] [2025-03-17 15:50:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859240091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604572998] [2025-03-17 15:50:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:10,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:10,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:10,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:10,724 INFO L87 Difference]: Start difference. First operand 2238 states and 3102 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:11,024 INFO L93 Difference]: Finished difference Result 3132 states and 4347 transitions. [2025-03-17 15:50:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-17 15:50:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:11,033 INFO L225 Difference]: With dead ends: 3132 [2025-03-17 15:50:11,033 INFO L226 Difference]: Without dead ends: 1770 [2025-03-17 15:50:11,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:11,037 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 197 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:11,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 435 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-17 15:50:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1598. [2025-03-17 15:50:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1259 states have (on average 1.3772835583796663) internal successors, (1734), 1289 states have internal predecessors, (1734), 194 states have call successors, (194), 121 states have call predecessors, (194), 141 states have return successors, (238), 191 states have call predecessors, (238), 194 states have call successors, (238) [2025-03-17 15:50:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2166 transitions. [2025-03-17 15:50:11,149 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2166 transitions. Word has length 65 [2025-03-17 15:50:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:11,149 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2166 transitions. [2025-03-17 15:50:11,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2166 transitions. [2025-03-17 15:50:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:11,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:11,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:50:11,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1043775260, now seen corresponding path program 1 times [2025-03-17 15:50:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898670139] [2025-03-17 15:50:11,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:11,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:11,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898670139] [2025-03-17 15:50:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898670139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:11,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:11,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236856103] [2025-03-17 15:50:11,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:11,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:11,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:11,231 INFO L87 Difference]: Start difference. First operand 1598 states and 2166 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:11,531 INFO L93 Difference]: Finished difference Result 2709 states and 3698 transitions. [2025-03-17 15:50:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-17 15:50:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:11,540 INFO L225 Difference]: With dead ends: 2709 [2025-03-17 15:50:11,540 INFO L226 Difference]: Without dead ends: 1535 [2025-03-17 15:50:11,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:11,542 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 200 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:11,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 422 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-17 15:50:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1370. [2025-03-17 15:50:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1083 states have (on average 1.3785780240073868) internal successors, (1493), 1102 states have internal predecessors, (1493), 169 states have call successors, (169), 104 states have call predecessors, (169), 114 states have return successors, (187), 165 states have call predecessors, (187), 169 states have call successors, (187) [2025-03-17 15:50:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1849 transitions. [2025-03-17 15:50:11,600 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1849 transitions. Word has length 65 [2025-03-17 15:50:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:11,600 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1849 transitions. [2025-03-17 15:50:11,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1849 transitions. [2025-03-17 15:50:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:11,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:11,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:11,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:50:11,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -18283261, now seen corresponding path program 1 times [2025-03-17 15:50:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31354234] [2025-03-17 15:50:11,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:11,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:11,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31354234] [2025-03-17 15:50:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31354234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967610717] [2025-03-17 15:50:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:11,638 INFO L87 Difference]: Start difference. First operand 1370 states and 1849 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:11,699 INFO L93 Difference]: Finished difference Result 2758 states and 3790 transitions. [2025-03-17 15:50:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-17 15:50:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:11,705 INFO L225 Difference]: With dead ends: 2758 [2025-03-17 15:50:11,705 INFO L226 Difference]: Without dead ends: 1396 [2025-03-17 15:50:11,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:11,709 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:11,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-03-17 15:50:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2025-03-17 15:50:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1109 states have (on average 1.363390441839495) internal successors, (1512), 1128 states have internal predecessors, (1512), 169 states have call successors, (169), 104 states have call predecessors, (169), 114 states have return successors, (187), 165 states have call predecessors, (187), 169 states have call successors, (187) [2025-03-17 15:50:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1868 transitions. [2025-03-17 15:50:11,763 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1868 transitions. Word has length 65 [2025-03-17 15:50:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1868 transitions. [2025-03-17 15:50:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1868 transitions. [2025-03-17 15:50:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:11,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:11,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:11,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:50:11,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:11,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1443296738, now seen corresponding path program 1 times [2025-03-17 15:50:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:11,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421386622] [2025-03-17 15:50:11,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:11,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421386622] [2025-03-17 15:50:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421386622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949149406] [2025-03-17 15:50:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:11,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:11,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:11,841 INFO L87 Difference]: Start difference. First operand 1396 states and 1868 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:12,101 INFO L93 Difference]: Finished difference Result 2523 states and 3368 transitions. [2025-03-17 15:50:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:12,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-17 15:50:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:12,107 INFO L225 Difference]: With dead ends: 2523 [2025-03-17 15:50:12,107 INFO L226 Difference]: Without dead ends: 1330 [2025-03-17 15:50:12,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:12,109 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 167 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:12,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 414 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-17 15:50:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1241. [2025-03-17 15:50:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 991 states have (on average 1.3612512613521695) internal successors, (1349), 1007 states have internal predecessors, (1349), 147 states have call successors, (147), 92 states have call predecessors, (147), 99 states have return successors, (158), 142 states have call predecessors, (158), 147 states have call successors, (158) [2025-03-17 15:50:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1654 transitions. [2025-03-17 15:50:12,159 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1654 transitions. Word has length 65 [2025-03-17 15:50:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:12,159 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1654 transitions. [2025-03-17 15:50:12,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1654 transitions. [2025-03-17 15:50:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:12,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:12,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:50:12,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -740380189, now seen corresponding path program 1 times [2025-03-17 15:50:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71891622] [2025-03-17 15:50:12,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:12,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:12,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:50:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71891622] [2025-03-17 15:50:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71891622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168572965] [2025-03-17 15:50:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:12,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:12,200 INFO L87 Difference]: Start difference. First operand 1241 states and 1654 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:50:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:12,413 INFO L93 Difference]: Finished difference Result 3620 states and 4918 transitions. [2025-03-17 15:50:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-03-17 15:50:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:12,423 INFO L225 Difference]: With dead ends: 3620 [2025-03-17 15:50:12,423 INFO L226 Difference]: Without dead ends: 2388 [2025-03-17 15:50:12,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:12,426 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 170 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:12,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 302 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2025-03-17 15:50:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2372. [2025-03-17 15:50:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1899 states have (on average 1.3454449710373881) internal successors, (2555), 1931 states have internal predecessors, (2555), 270 states have call successors, (270), 172 states have call predecessors, (270), 199 states have return successors, (363), 270 states have call predecessors, (363), 270 states have call successors, (363) [2025-03-17 15:50:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3188 transitions. [2025-03-17 15:50:12,543 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3188 transitions. Word has length 65 [2025-03-17 15:50:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:12,543 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3188 transitions. [2025-03-17 15:50:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:50:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3188 transitions. [2025-03-17 15:50:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:50:12,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:12,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:12,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:50:12,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1161008022, now seen corresponding path program 1 times [2025-03-17 15:50:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511543196] [2025-03-17 15:50:12,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:50:12,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:50:12,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:12,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 15:50:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:12,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511543196] [2025-03-17 15:50:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511543196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668095832] [2025-03-17 15:50:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:12,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:12,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:12,566 INFO L87 Difference]: Start difference. First operand 2372 states and 3188 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:12,649 INFO L93 Difference]: Finished difference Result 4318 states and 5769 transitions. [2025-03-17 15:50:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2025-03-17 15:50:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:12,657 INFO L225 Difference]: With dead ends: 4318 [2025-03-17 15:50:12,657 INFO L226 Difference]: Without dead ends: 1955 [2025-03-17 15:50:12,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:12,662 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:12,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2025-03-17 15:50:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2025-03-17 15:50:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1574 states have (on average 1.3341804320203303) internal successors, (2100), 1603 states have internal predecessors, (2100), 212 states have call successors, (212), 140 states have call predecessors, (212), 165 states have return successors, (282), 212 states have call predecessors, (282), 212 states have call successors, (282) [2025-03-17 15:50:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2594 transitions. [2025-03-17 15:50:12,741 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2594 transitions. Word has length 67 [2025-03-17 15:50:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2594 transitions. [2025-03-17 15:50:12,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2594 transitions. [2025-03-17 15:50:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:50:12,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:12,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:50:12,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 804798083, now seen corresponding path program 1 times [2025-03-17 15:50:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598410570] [2025-03-17 15:50:12,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:50:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:50:12,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 15:50:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598410570] [2025-03-17 15:50:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598410570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186870934] [2025-03-17 15:50:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:12,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:12,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:12,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:12,792 INFO L87 Difference]: Start difference. First operand 1955 states and 2594 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:50:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:13,227 INFO L93 Difference]: Finished difference Result 5917 states and 7950 transitions. [2025-03-17 15:50:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:50:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2025-03-17 15:50:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:13,246 INFO L225 Difference]: With dead ends: 5917 [2025-03-17 15:50:13,246 INFO L226 Difference]: Without dead ends: 3786 [2025-03-17 15:50:13,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:50:13,253 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 497 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:13,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 607 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:50:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2025-03-17 15:50:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3600. [2025-03-17 15:50:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2893 states have (on average 1.3093674386450052) internal successors, (3788), 2945 states have internal predecessors, (3788), 393 states have call successors, (393), 266 states have call predecessors, (393), 310 states have return successors, (609), 389 states have call predecessors, (609), 393 states have call successors, (609) [2025-03-17 15:50:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4790 transitions. [2025-03-17 15:50:13,424 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4790 transitions. Word has length 69 [2025-03-17 15:50:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:13,425 INFO L471 AbstractCegarLoop]: Abstraction has 3600 states and 4790 transitions. [2025-03-17 15:50:13,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:50:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4790 transitions. [2025-03-17 15:50:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 15:50:13,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:13,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:13,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:50:13,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:13,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1485746763, now seen corresponding path program 1 times [2025-03-17 15:50:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:13,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633169249] [2025-03-17 15:50:13,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:13,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:50:13,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:50:13,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633169249] [2025-03-17 15:50:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633169249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903021165] [2025-03-17 15:50:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:13,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:13,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:13,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:13,458 INFO L87 Difference]: Start difference. First operand 3600 states and 4790 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:50:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:13,654 INFO L93 Difference]: Finished difference Result 6524 states and 8768 transitions. [2025-03-17 15:50:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:13,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-17 15:50:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:13,670 INFO L225 Difference]: With dead ends: 6524 [2025-03-17 15:50:13,670 INFO L226 Difference]: Without dead ends: 4274 [2025-03-17 15:50:13,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:13,677 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 99 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:13,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 284 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2025-03-17 15:50:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3372. [2025-03-17 15:50:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 2697 states have (on average 1.2969966629588432) internal successors, (3498), 2741 states have internal predecessors, (3498), 381 states have call successors, (381), 258 states have call predecessors, (381), 290 states have return successors, (552), 373 states have call predecessors, (552), 381 states have call successors, (552) [2025-03-17 15:50:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4431 transitions. [2025-03-17 15:50:13,853 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4431 transitions. Word has length 72 [2025-03-17 15:50:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:13,854 INFO L471 AbstractCegarLoop]: Abstraction has 3372 states and 4431 transitions. [2025-03-17 15:50:13,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:50:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4431 transitions. [2025-03-17 15:50:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 15:50:13,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:13,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:13,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:50:13,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:13,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -650082048, now seen corresponding path program 1 times [2025-03-17 15:50:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:13,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805422678] [2025-03-17 15:50:13,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 15:50:13,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 15:50:13,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:13,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 15:50:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805422678] [2025-03-17 15:50:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805422678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:13,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160398636] [2025-03-17 15:50:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:13,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:13,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:13,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:13,908 INFO L87 Difference]: Start difference. First operand 3372 states and 4431 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:50:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:14,126 INFO L93 Difference]: Finished difference Result 5476 states and 7187 transitions. [2025-03-17 15:50:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2025-03-17 15:50:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:14,135 INFO L225 Difference]: With dead ends: 5476 [2025-03-17 15:50:14,136 INFO L226 Difference]: Without dead ends: 2803 [2025-03-17 15:50:14,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:14,140 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 161 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:14,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 250 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2025-03-17 15:50:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2765. [2025-03-17 15:50:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2200 states have (on average 1.290909090909091) internal successors, (2840), 2255 states have internal predecessors, (2840), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2025-03-17 15:50:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3574 transitions. [2025-03-17 15:50:14,250 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3574 transitions. Word has length 81 [2025-03-17 15:50:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 2765 states and 3574 transitions. [2025-03-17 15:50:14,251 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:50:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3574 transitions. [2025-03-17 15:50:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 15:50:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:14,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:14,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:50:14,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -274855917, now seen corresponding path program 1 times [2025-03-17 15:50:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383803184] [2025-03-17 15:50:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:14,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 15:50:14,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:50:14,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:14,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:50:14,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:14,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383803184] [2025-03-17 15:50:14,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383803184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:14,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:50:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947566594] [2025-03-17 15:50:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:14,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:50:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:14,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:50:14,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:14,304 INFO L87 Difference]: Start difference. First operand 2765 states and 3574 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:50:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:14,765 INFO L93 Difference]: Finished difference Result 4633 states and 6045 transitions. [2025-03-17 15:50:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:50:14,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-03-17 15:50:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:14,779 INFO L225 Difference]: With dead ends: 4633 [2025-03-17 15:50:14,780 INFO L226 Difference]: Without dead ends: 2847 [2025-03-17 15:50:14,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:50:14,783 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 823 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:14,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 693 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:50:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2025-03-17 15:50:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2765. [2025-03-17 15:50:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2200 states have (on average 1.280909090909091) internal successors, (2818), 2255 states have internal predecessors, (2818), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2025-03-17 15:50:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3519 transitions. [2025-03-17 15:50:14,939 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3519 transitions. Word has length 83 [2025-03-17 15:50:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:14,939 INFO L471 AbstractCegarLoop]: Abstraction has 2765 states and 3519 transitions. [2025-03-17 15:50:14,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:50:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3519 transitions. [2025-03-17 15:50:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:50:14,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:14,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:14,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 15:50:14,941 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:14,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -916442222, now seen corresponding path program 1 times [2025-03-17 15:50:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203391127] [2025-03-17 15:50:14,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:14,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:50:14,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:50:14,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:14,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:50:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203391127] [2025-03-17 15:50:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203391127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:50:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766119392] [2025-03-17 15:50:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:14,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:14,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:14,990 INFO L87 Difference]: Start difference. First operand 2765 states and 3519 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:50:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:15,192 INFO L93 Difference]: Finished difference Result 2765 states and 3519 transitions. [2025-03-17 15:50:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-03-17 15:50:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:15,200 INFO L225 Difference]: With dead ends: 2765 [2025-03-17 15:50:15,200 INFO L226 Difference]: Without dead ends: 2764 [2025-03-17 15:50:15,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:15,201 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:15,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-17 15:50:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-03-17 15:50:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2200 states have (on average 1.2768181818181819) internal successors, (2809), 2254 states have internal predecessors, (2809), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2025-03-17 15:50:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3510 transitions. [2025-03-17 15:50:15,344 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3510 transitions. Word has length 89 [2025-03-17 15:50:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:15,344 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3510 transitions. [2025-03-17 15:50:15,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:50:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3510 transitions. [2025-03-17 15:50:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 15:50:15,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:15,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:15,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 15:50:15,346 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:50:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1655062251, now seen corresponding path program 1 times [2025-03-17 15:50:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574647769] [2025-03-17 15:50:15,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:50:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:50:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 15:50:15,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 15:50:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:50:15,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:50:15,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:15,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 15:50:15,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 15:50:15,386 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 15:50:15,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:50:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:50:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:50:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:50:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 15:50:15,390 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:15,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:50:15,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:50:15 BoogieIcfgContainer [2025-03-17 15:50:15,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:50:15,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:50:15,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:50:15,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:50:15,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:07" (3/4) ... [2025-03-17 15:50:15,450 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 15:50:15,529 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 72. [2025-03-17 15:50:15,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:50:15,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:50:15,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:50:15,596 INFO L158 Benchmark]: Toolchain (without parser) took 8646.68ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 112.5MB in the beginning and 555.2MB in the end (delta: -442.7MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:50:15,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.27ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,597 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:50:15,597 INFO L158 Benchmark]: IcfgBuilder took 328.37ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 77.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,598 INFO L158 Benchmark]: TraceAbstraction took 7898.51ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 76.6MB in the beginning and 567.8MB in the end (delta: -491.2MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,599 INFO L158 Benchmark]: Witness Printer took 146.59ms. Allocated memory is still 671.1MB. Free memory was 567.8MB in the beginning and 555.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:50:15,600 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.20ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.27ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 328.37ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 77.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7898.51ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 76.6MB in the beginning and 567.8MB in the end (delta: -491.2MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 146.59ms. Allocated memory is still 671.1MB. Free memory was 567.8MB in the beginning and 555.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 102 locations, 164 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4331 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4229 mSDsluCounter, 7819 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5031 mSDsCounter, 698 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3395 IncrementalHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 698 mSolverCounterUnsat, 2788 mSDtfsCounter, 3395 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3600occurred in iteration=15, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 170/170 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-17 15:50:15,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)