./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_17_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 553c6f2df5271703f0452391d4b0d8f672e3dbb685739cd240a8fec3a199a9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:57:23,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:57:23,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:57:23,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:57:23,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:57:23,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:57:23,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:57:23,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:57:23,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:57:23,191 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:57:23,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:57:23,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:57:23,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:57:23,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:57:23,192 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:57:23,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:57:23,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:57:23,193 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:57:23,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:57:23,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:57:23,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:57:23,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:57:23,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:57:23,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:57:23,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:57:23,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:57:23,195 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 553c6f2df5271703f0452391d4b0d8f672e3dbb685739cd240a8fec3a199a9bc [2025-02-06 17:57:23,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:57:23,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:57:23,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:57:23,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:57:23,454 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:57:23,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_17_good.i [2025-02-06 17:57:24,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d793164a/cf940a5f2e6a437c8683bbd2b27ed127/FLAG3ca4de015 [2025-02-06 17:57:24,904 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:57:24,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_17_good.i [2025-02-06 17:57:24,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d793164a/cf940a5f2e6a437c8683bbd2b27ed127/FLAG3ca4de015 [2025-02-06 17:57:25,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d793164a/cf940a5f2e6a437c8683bbd2b27ed127 [2025-02-06 17:57:25,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:57:25,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:57:25,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:57:25,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:57:25,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:57:25,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25, skipping insertion in model container [2025-02-06 17:57:25,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:57:25,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:57:25,791 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:57:25,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:57:25,937 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:57:25,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25 WrapperNode [2025-02-06 17:57:25,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:57:25,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:57:25,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:57:25,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:57:25,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,973 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-02-06 17:57:25,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:57:25,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:57:25,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:57:25,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:57:25,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,991 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 17:57:25,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:25,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:26,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:57:26,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:57:26,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:57:26,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:57:26,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (1/1) ... [2025-02-06 17:57:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:57:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:26,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 17:57:26,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 17:57:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 17:57:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 17:57:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 17:57:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 17:57:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:57:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:57:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:57:26,144 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:57:26,145 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:57:26,341 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-02-06 17:57:26,341 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:57:26,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:57:26,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:57:26,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:57:26 BoogieIcfgContainer [2025-02-06 17:57:26,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:57:26,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:57:26,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:57:26,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:57:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:57:25" (1/3) ... [2025-02-06 17:57:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510be7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:57:26, skipping insertion in model container [2025-02-06 17:57:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:25" (2/3) ... [2025-02-06 17:57:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510be7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:57:26, skipping insertion in model container [2025-02-06 17:57:26,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:57:26" (3/3) ... [2025-02-06 17:57:26,364 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_17_good.i [2025-02-06 17:57:26,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:57:26,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_sub_17_good.i that has 3 procedures, 76 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-02-06 17:57:26,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:57:26,439 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;@4d924bf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:57:26,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 17:57:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 69 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 17:57:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:57:26,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:26,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:26,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 684469514, now seen corresponding path program 1 times [2025-02-06 17:57:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287106487] [2025-02-06 17:57:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:57:26,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:57:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287106487] [2025-02-06 17:57:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287106487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:26,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423475389] [2025-02-06 17:57:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:26,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:26,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:26,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:26,641 INFO L87 Difference]: Start difference. First operand has 76 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 69 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:26,678 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2025-02-06 17:57:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 17:57:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:26,683 INFO L225 Difference]: With dead ends: 144 [2025-02-06 17:57:26,683 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 17:57:26,685 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-02-06 17:57:26,686 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:26,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 17:57:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2025-02-06 17:57:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 64 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-02-06 17:57:26,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 12 [2025-02-06 17:57:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-02-06 17:57:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-02-06 17:57:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 17:57:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:26,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:26,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:57:26,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:26,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1158510985, now seen corresponding path program 1 times [2025-02-06 17:57:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:26,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-06 17:57:26,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 17:57:26,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 17:57:26,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-06 17:57:26,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610469133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:26,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:26,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629940672] [2025-02-06 17:57:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:26,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:57:26,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:26,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:57:26,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:57:26,853 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:26,916 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2025-02-06 17:57:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:57:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 17:57:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:26,917 INFO L225 Difference]: With dead ends: 96 [2025-02-06 17:57:26,917 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 17:57:26,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-06 17:57:26,918 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:26,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:57:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 17:57:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 17:57:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.5657894736842106) internal successors, (119), 88 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2025-02-06 17:57:26,925 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 16 [2025-02-06 17:57:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:26,925 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2025-02-06 17:57:26,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2025-02-06 17:57:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 17:57:26,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:26,926 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] [2025-02-06 17:57:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 17:57:26,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1043888330, now seen corresponding path program 1 times [2025-02-06 17:57:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-02-06 17:57:26,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:26,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 17:57:26,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 17:57:26,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:26,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:57:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-02-06 17:57:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297628439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:26,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083791467] [2025-02-06 17:57:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:26,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:26,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:26,991 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:27,017 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2025-02-06 17:57:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:27,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-06 17:57:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:27,018 INFO L225 Difference]: With dead ends: 139 [2025-02-06 17:57:27,018 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 17:57:27,019 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-02-06 17:57:27,019 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:27,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 158 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 17:57:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-02-06 17:57:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 91 states have internal predecessors, (126), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-02-06 17:57:27,026 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 21 [2025-02-06 17:57:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:27,027 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-02-06 17:57:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-02-06 17:57:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:57:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:27,027 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] [2025-02-06 17:57:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:57:27,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1999200146, now seen corresponding path program 1 times [2025-02-06 17:57:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:27,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332570335] [2025-02-06 17:57:27,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 17:57:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 17:57:27,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:27,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332570335] [2025-02-06 17:57:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332570335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599319313] [2025-02-06 17:57:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:27,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:27,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:27,146 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:27,161 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2025-02-06 17:57:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 17:57:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:27,162 INFO L225 Difference]: With dead ends: 98 [2025-02-06 17:57:27,162 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 17:57:27,162 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-02-06 17:57:27,163 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:27,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 17:57:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 17:57:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 90 states have internal predecessors, (125), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-02-06 17:57:27,171 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 22 [2025-02-06 17:57:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:27,171 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-02-06 17:57:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-02-06 17:57:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:57:27,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:27,171 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] [2025-02-06 17:57:27,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 17:57:27,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1999217092, now seen corresponding path program 1 times [2025-02-06 17:57:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846027288] [2025-02-06 17:57:27,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:27,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 17:57:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 17:57:27,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:57:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846027288] [2025-02-06 17:57:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846027288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503210917] [2025-02-06 17:57:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:27,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:27,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:27,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:27,236 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:27,259 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2025-02-06 17:57:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 17:57:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:27,261 INFO L225 Difference]: With dead ends: 126 [2025-02-06 17:57:27,261 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 17:57:27,261 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-02-06 17:57:27,262 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:27,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 17:57:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-02-06 17:57:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 91 states have internal predecessors, (126), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-02-06 17:57:27,285 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 22 [2025-02-06 17:57:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-02-06 17:57:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-02-06 17:57:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 17:57:27,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:27,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 17:57:27,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1427958435, now seen corresponding path program 1 times [2025-02-06 17:57:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11527933] [2025-02-06 17:57:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:27,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 17:57:27,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 17:57:27,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:27,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:27,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11527933] [2025-02-06 17:57:27,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11527933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:27,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540294188] [2025-02-06 17:57:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:27,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:57:27,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 17:57:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 17:57:27,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 17:57:27,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:27,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 17:57:27,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:27,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540294188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 17:57:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566032431] [2025-02-06 17:57:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:57:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:27,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:57:27,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:27,562 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:27,601 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2025-02-06 17:57:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:57:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-06 17:57:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:27,609 INFO L225 Difference]: With dead ends: 141 [2025-02-06 17:57:27,609 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 17:57:27,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:27,610 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 29 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:27,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 268 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 17:57:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 17:57:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 65 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2025-02-06 17:57:27,617 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 25 [2025-02-06 17:57:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:27,617 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2025-02-06 17:57:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2025-02-06 17:57:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 17:57:27,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:27,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:27,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 17:57:27,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:27,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:27,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -580458891, now seen corresponding path program 1 times [2025-02-06 17:57:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096368008] [2025-02-06 17:57:27,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 17:57:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 17:57:27,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 17:57:27,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:27,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096368008] [2025-02-06 17:57:27,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096368008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:27,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:27,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159089802] [2025-02-06 17:57:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:57:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:27,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:57:27,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:57:27,910 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:57:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:27,958 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2025-02-06 17:57:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:57:27,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-06 17:57:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:27,959 INFO L225 Difference]: With dead ends: 86 [2025-02-06 17:57:27,959 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 17:57:27,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-06 17:57:27,960 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 5 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:27,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 17:57:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-06 17:57:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 75 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 17:57:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2025-02-06 17:57:27,966 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 27 [2025-02-06 17:57:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:27,966 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-02-06 17:57:27,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:57:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2025-02-06 17:57:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 17:57:27,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:27,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:27,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:57:27,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:27,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash -726321158, now seen corresponding path program 1 times [2025-02-06 17:57:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868772553] [2025-02-06 17:57:27,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:27,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 17:57:27,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 17:57:27,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:27,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 17:57:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868772553] [2025-02-06 17:57:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868772553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:28,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749237852] [2025-02-06 17:57:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:28,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:57:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:28,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:57:28,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:57:28,012 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:28,035 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2025-02-06 17:57:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:57:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-06 17:57:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:28,036 INFO L225 Difference]: With dead ends: 103 [2025-02-06 17:57:28,036 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 17:57:28,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-06 17:57:28,037 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:28,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 229 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 17:57:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 17:57:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.408450704225352) internal successors, (100), 78 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 17:57:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-02-06 17:57:28,043 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 32 [2025-02-06 17:57:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:28,043 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-02-06 17:57:28,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-02-06 17:57:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 17:57:28,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:28,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:28,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 17:57:28,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 211614431, now seen corresponding path program 1 times [2025-02-06 17:57:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423392278] [2025-02-06 17:57:28,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:28,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 17:57:28,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 17:57:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 17:57:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423392278] [2025-02-06 17:57:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423392278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91831577] [2025-02-06 17:57:28,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:28,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:57:28,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 17:57:28,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 17:57:28,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 17:57:28,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 17:57:28,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 17:57:28,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91831577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 17:57:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435836054] [2025-02-06 17:57:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:28,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:57:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:28,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:57:28,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:28,210 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:28,228 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2025-02-06 17:57:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:57:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-06 17:57:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:28,229 INFO L225 Difference]: With dead ends: 102 [2025-02-06 17:57:28,229 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 17:57:28,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:28,229 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:28,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 17:57:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 17:57:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 74 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 17:57:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-02-06 17:57:28,235 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 35 [2025-02-06 17:57:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:28,235 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-02-06 17:57:28,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-02-06 17:57:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 17:57:28,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:28,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:28,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 17:57:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:28,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:28,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1848720897, now seen corresponding path program 1 times [2025-02-06 17:57:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540600732] [2025-02-06 17:57:28,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:28,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 17:57:28,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 17:57:28,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 17:57:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540600732] [2025-02-06 17:57:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540600732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113508635] [2025-02-06 17:57:28,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:28,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:57:28,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 17:57:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 17:57:28,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 17:57:28,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 17:57:28,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 17:57:28,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113508635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 17:57:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764856435] [2025-02-06 17:57:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:57:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:28,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:57:28,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:28,607 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 17:57:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:28,648 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2025-02-06 17:57:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:57:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-02-06 17:57:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:28,650 INFO L225 Difference]: With dead ends: 108 [2025-02-06 17:57:28,651 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 17:57:28,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:28,651 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:28,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 271 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 17:57:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-02-06 17:57:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 58 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-02-06 17:57:28,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 37 [2025-02-06 17:57:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-02-06 17:57:28,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 17:57:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-02-06 17:57:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 17:57:28,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:28,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:28,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 17:57:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:28,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2029892201, now seen corresponding path program 1 times [2025-02-06 17:57:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084377541] [2025-02-06 17:57:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:28,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 17:57:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 17:57:28,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 17:57:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084377541] [2025-02-06 17:57:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084377541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584483987] [2025-02-06 17:57:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:28,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:28,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:28,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:28,906 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:28,928 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-02-06 17:57:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 17:57:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:28,929 INFO L225 Difference]: With dead ends: 64 [2025-02-06 17:57:28,929 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 17:57:28,929 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-02-06 17:57:28,930 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:28,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 17:57:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 17:57:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 57 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-02-06 17:57:28,934 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 36 [2025-02-06 17:57:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:28,935 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-02-06 17:57:28,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-02-06 17:57:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 17:57:28,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:28,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:28,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 17:57:28,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:28,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1497851197, now seen corresponding path program 1 times [2025-02-06 17:57:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:28,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402798889] [2025-02-06 17:57:28,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:28,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 17:57:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 17:57:28,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:28,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 17:57:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402798889] [2025-02-06 17:57:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402798889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137497454] [2025-02-06 17:57:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:28,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:28,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:28,988 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:29,004 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-02-06 17:57:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-06 17:57:29,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:29,005 INFO L225 Difference]: With dead ends: 63 [2025-02-06 17:57:29,006 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 17:57:29,006 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-02-06 17:57:29,007 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:29,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 17:57:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 17:57:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 56 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:57:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-02-06 17:57:29,011 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 37 [2025-02-06 17:57:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-02-06 17:57:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-02-06 17:57:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 17:57:29,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:29,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 17:57:29,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash -326538501, now seen corresponding path program 1 times [2025-02-06 17:57:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114799947] [2025-02-06 17:57:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 17:57:29,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 17:57:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:29,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 17:57:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114799947] [2025-02-06 17:57:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114799947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:57:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355918852] [2025-02-06 17:57:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:29,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:57:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:29,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:57:29,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:57:29,071 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:57:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:29,100 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-02-06 17:57:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:57:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-02-06 17:57:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:29,105 INFO L225 Difference]: With dead ends: 71 [2025-02-06 17:57:29,105 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 17:57:29,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-06 17:57:29,105 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:29,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 17:57:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 17:57:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 62 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 17:57:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-02-06 17:57:29,110 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 43 [2025-02-06 17:57:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-02-06 17:57:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:57:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-02-06 17:57:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 17:57:29,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:29,112 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] [2025-02-06 17:57:29,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 17:57:29,112 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 17:57:29,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1592385729, now seen corresponding path program 1 times [2025-02-06 17:57:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086824914] [2025-02-06 17:57:29,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:29,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 17:57:29,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 17:57:29,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:29,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 17:57:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086824914] [2025-02-06 17:57:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086824914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20157354] [2025-02-06 17:57:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:29,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:29,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:29,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:57:29,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 17:57:29,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 17:57:29,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 17:57:29,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:29,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:29,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 17:57:29,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 17:57:29,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20157354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 17:57:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431544486] [2025-02-06 17:57:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:57:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:29,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:57:29,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:29,320 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 17:57:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:29,343 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2025-02-06 17:57:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:57:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2025-02-06 17:57:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:29,344 INFO L225 Difference]: With dead ends: 73 [2025-02-06 17:57:29,344 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 17:57:29,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:29,344 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:29,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 17:57:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 17:57:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 17:57:29,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-02-06 17:57:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:29,347 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 17:57:29,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 17:57:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 17:57:29,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 17:57:29,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-02-06 17:57:29,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-02-06 17:57:29,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 17:57:29,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 17:57:29,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:29,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 17:57:29,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 17:57:29,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:57:29 BoogieIcfgContainer [2025-02-06 17:57:29,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 17:57:29,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 17:57:29,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 17:57:29,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 17:57:29,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:57:26" (3/4) ... [2025-02-06 17:57:29,650 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 17:57:29,653 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 17:57:29,654 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 17:57:29,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 17:57:29,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 17:57:29,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 17:57:29,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 17:57:29,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 17:57:29,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 17:57:29,743 INFO L158 Benchmark]: Toolchain (without parser) took 4570.45ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 95.2MB in the end (delta: 32.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-06 17:57:29,743 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:57:29,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.36ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 67.5MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 17:57:29,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 167.8MB. Free memory was 67.3MB in the beginning and 64.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:57:29,744 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 62.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:57:29,744 INFO L158 Benchmark]: IcfgBuilder took 353.45ms. Allocated memory is still 167.8MB. Free memory was 62.7MB in the beginning and 43.3MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:57:29,745 INFO L158 Benchmark]: TraceAbstraction took 3291.36ms. Allocated memory is still 167.8MB. Free memory was 42.3MB in the beginning and 102.9MB in the end (delta: -60.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:57:29,745 INFO L158 Benchmark]: Witness Printer took 94.47ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 95.2MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:57:29,746 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.36ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 67.5MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 167.8MB. Free memory was 67.3MB in the beginning and 64.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 62.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 353.45ms. Allocated memory is still 167.8MB. Free memory was 62.7MB in the beginning and 43.3MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3291.36ms. Allocated memory is still 167.8MB. Free memory was 42.3MB in the beginning and 102.9MB in the end (delta: -60.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 94.47ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 95.2MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 2731 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1651 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1080 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 131/135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: ((((0 <= ((long) 2147483647 + data)) && (i == 0)) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) - InvariantResult [Line: 1579]: Location Invariant Derived location invariant: (((j == 0) && (((long) data + 2) == 0)) || ((1 <= j) && (((long) data + 2) == 0))) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) - InvariantResult [Line: 1575]: Location Invariant Derived location invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) RESULT: Ultimate proved your program to be correct! [2025-02-06 17:57:29,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE