./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/CWE190_Integer_Overflow__int_max_postinc_08_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 8f61a3d9362439b5f21eed7147f1613cc8d4d3e66351a52d1d8cad0a4a3751fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:03:00,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:03:00,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:03:00,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:03:00,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:03:00,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:03:00,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:03:00,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:03:00,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:03:00,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:03:00,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:03:00,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:03:00,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:03:00,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:03:00,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:03:00,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:03:00,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:03:00,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:03:00,432 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 -> 8f61a3d9362439b5f21eed7147f1613cc8d4d3e66351a52d1d8cad0a4a3751fe [2025-02-08 12:03:00,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:03:00,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:03:00,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:03:00,634 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:03:00,635 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:03:00,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_08_good.i [2025-02-08 12:03:02,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/915c04383/5363cf220d2044fc9a4664b215c6f8c2/FLAG1e2d58396 [2025-02-08 12:03:02,587 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:03:02,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_08_good.i [2025-02-08 12:03:02,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/915c04383/5363cf220d2044fc9a4664b215c6f8c2/FLAG1e2d58396 [2025-02-08 12:03:02,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/915c04383/5363cf220d2044fc9a4664b215c6f8c2 [2025-02-08 12:03:02,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:03:02,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:03:02,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:03:02,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:03:02,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:03:02,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:03:02" (1/1) ... [2025-02-08 12:03:02,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:02, skipping insertion in model container [2025-02-08 12:03:02,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:03:02" (1/1) ... [2025-02-08 12:03:02,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:03:03,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:03:03,226 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:03:03,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:03:03,364 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:03:03,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03 WrapperNode [2025-02-08 12:03:03,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:03:03,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:03:03,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:03:03,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:03:03,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,417 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-02-08 12:03:03,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:03:03,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:03:03,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:03:03,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:03:03,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,441 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 12:03:03,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:03:03,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:03:03,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:03:03,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:03:03,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (1/1) ... [2025-02-08 12:03:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:03:03,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:03:03,481 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-08 12:03:03,488 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-08 12:03:03,503 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 12:03:03,504 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 12:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:03:03,504 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:03:03,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-02-08 12:03:03,505 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-02-08 12:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-02-08 12:03:03,505 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-02-08 12:03:03,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:03:03,627 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:03:03,794 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-08 12:03:03,797 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:03:03,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:03:03,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:03:03,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:03:03 BoogieIcfgContainer [2025-02-08 12:03:03,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:03:03,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:03:03,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:03:03,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:03:03,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:03:02" (1/3) ... [2025-02-08 12:03:03,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681778c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:03:03, skipping insertion in model container [2025-02-08 12:03:03,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:03:03" (2/3) ... [2025-02-08 12:03:03,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681778c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:03:03, skipping insertion in model container [2025-02-08 12:03:03,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:03:03" (3/3) ... [2025-02-08 12:03:03,819 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_postinc_08_good.i [2025-02-08 12:03:03,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:03:03,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_postinc_08_good.i that has 5 procedures, 78 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 12:03:03,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:03:03,887 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;@14e5eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:03:03,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 12:03:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 59 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 12:03:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 12:03:03,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:03,897 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-08 12:03:03,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -739307599, now seen corresponding path program 1 times [2025-02-08 12:03:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025509834] [2025-02-08 12:03:03,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:03,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 12:03:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 12:03:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,059 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-08 12:03:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025509834] [2025-02-08 12:03:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025509834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:04,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:03:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184848406] [2025-02-08 12:03:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:03:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:04,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:03:04,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:03:04,076 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 59 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 12:03:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:04,098 INFO L93 Difference]: Finished difference Result 150 states and 194 transitions. [2025-02-08 12:03:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:03:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2025-02-08 12:03:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:04,104 INFO L225 Difference]: With dead ends: 150 [2025-02-08 12:03:04,104 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 12:03:04,106 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-08 12:03:04,108 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:04,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 12:03:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-02-08 12:03:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.391304347826087) internal successors, (64), 57 states have internal predecessors, (64), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 12:03:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2025-02-08 12:03:04,138 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 21 [2025-02-08 12:03:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2025-02-08 12:03:04,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 12:03:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2025-02-08 12:03:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 12:03:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:04,141 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-08 12:03:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:03:04,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1748205234, now seen corresponding path program 1 times [2025-02-08 12:03:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208158264] [2025-02-08 12:03:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:04,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 12:03:04,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 12:03:04,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:04,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,290 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-08 12:03:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:04,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208158264] [2025-02-08 12:03:04,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208158264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:04,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:04,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 12:03:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859877421] [2025-02-08 12:03:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:04,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:04,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:04,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:04,293 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 12:03:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:04,321 INFO L93 Difference]: Finished difference Result 130 states and 167 transitions. [2025-02-08 12:03:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2025-02-08 12:03:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:04,323 INFO L225 Difference]: With dead ends: 130 [2025-02-08 12:03:04,324 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 12:03:04,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:04,325 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:04,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 12:03:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 12:03:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.325) internal successors, (53), 48 states have internal predecessors, (53), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 12:03:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2025-02-08 12:03:04,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 21 [2025-02-08 12:03:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2025-02-08 12:03:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 12:03:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2025-02-08 12:03:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 12:03:04,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:04,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 12:03:04,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 12:03:04,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1345678058, now seen corresponding path program 1 times [2025-02-08 12:03:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-02-08 12:03:04,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:04,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 12:03:04,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 12:03:04,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 12:03:04,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:04,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-02-08 12:03:04,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394565050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:04,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:04,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 12:03:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217160088] [2025-02-08 12:03:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:04,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:04,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:04,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:04,444 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:04,462 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2025-02-08 12:03:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:04,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-02-08 12:03:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:04,463 INFO L225 Difference]: With dead ends: 118 [2025-02-08 12:03:04,463 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 12:03:04,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:04,464 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:04,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 12:03:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 12:03:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 12:03:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-02-08 12:03:04,470 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 39 [2025-02-08 12:03:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-02-08 12:03:04,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-02-08 12:03:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 12:03:04,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:04,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-08 12:03:04,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:03:04,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:04,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1423445262, now seen corresponding path program 1 times [2025-02-08 12:03:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071868092] [2025-02-08 12:03:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:04,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 12:03:04,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 12:03:04,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 12:03:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071868092] [2025-02-08 12:03:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071868092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:04,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:04,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:03:04,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218249753] [2025-02-08 12:03:04,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:04,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:03:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:04,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:03:04,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:03:04,556 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:04,568 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2025-02-08 12:03:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:03:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-02-08 12:03:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:04,569 INFO L225 Difference]: With dead ends: 113 [2025-02-08 12:03:04,570 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 12:03:04,570 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-08 12:03:04,570 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:04,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 12:03:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-08 12:03:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.302325581395349) internal successors, (56), 50 states have internal predecessors, (56), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 12:03:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2025-02-08 12:03:04,576 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 40 [2025-02-08 12:03:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:04,576 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2025-02-08 12:03:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2025-02-08 12:03:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 12:03:04,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:04,577 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-08 12:03:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 12:03:04,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash -384009201, now seen corresponding path program 1 times [2025-02-08 12:03:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-08 12:03:04,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:04,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 12:03:04,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 12:03:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 12:03:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-08 12:03:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610469133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:03:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911925014] [2025-02-08 12:03:04,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:03:04,699 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-08 12:03:04,707 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-08 12:03:04,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 12:03:04,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 12:03:04,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:04,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:04,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:03:04,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:03:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 12:03:04,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:03:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911925014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:03:04,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 12:03:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688015819] [2025-02-08 12:03:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:04,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:04,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:04,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:04,837 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:04,851 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-02-08 12:03:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-02-08 12:03:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:04,852 INFO L225 Difference]: With dead ends: 107 [2025-02-08 12:03:04,852 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 12:03:04,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:04,853 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:04,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 12:03:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 12:03:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 12:03:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-02-08 12:03:04,858 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 40 [2025-02-08 12:03:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-02-08 12:03:04,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 12:03:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-02-08 12:03:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 12:03:04,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:04,860 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:04,866 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-08 12:03:05,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:05,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1292962391, now seen corresponding path program 1 times [2025-02-08 12:03:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:05,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-02-08 12:03:05,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:05,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 12:03:05,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 12:03:05,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 12:03:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-02-08 12:03:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902402782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:03:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400450980] [2025-02-08 12:03:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:03:05,130 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-08 12:03:05,137 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-08 12:03:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 12:03:05,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 12:03:05,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:03:05,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:03:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 12:03:05,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:03:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400450980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:03:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 12:03:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176191140] [2025-02-08 12:03:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:05,255 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 12:03:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:05,266 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2025-02-08 12:03:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:05,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2025-02-08 12:03:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:05,267 INFO L225 Difference]: With dead ends: 96 [2025-02-08 12:03:05,267 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 12:03:05,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:05,267 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:05,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 12:03:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 12:03:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 12:03:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-02-08 12:03:05,272 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 52 [2025-02-08 12:03:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:05,272 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-02-08 12:03:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 12:03:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-02-08 12:03:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 12:03:05,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:05,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-08 12:03:05,280 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-08 12:03:05,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:05,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 41980830, now seen corresponding path program 1 times [2025-02-08 12:03:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043878590] [2025-02-08 12:03:05,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:05,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 12:03:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 12:03:05,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 12:03:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043878590] [2025-02-08 12:03:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043878590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:03:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187523714] [2025-02-08 12:03:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:05,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:05,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:05,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:05,575 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 12:03:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:05,592 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-02-08 12:03:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-02-08 12:03:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:05,593 INFO L225 Difference]: With dead ends: 66 [2025-02-08 12:03:05,593 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 12:03:05,593 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-08 12:03:05,594 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:05,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 12:03:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-02-08 12:03:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 12:03:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-02-08 12:03:05,599 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 58 [2025-02-08 12:03:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:05,599 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-02-08 12:03:05,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 12:03:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-02-08 12:03:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 12:03:05,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:05,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 12:03:05,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1282585511, now seen corresponding path program 1 times [2025-02-08 12:03:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159089802] [2025-02-08 12:03:05,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:05,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 12:03:05,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 12:03:05,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-08 12:03:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159089802] [2025-02-08 12:03:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159089802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:05,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:05,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 12:03:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323303223] [2025-02-08 12:03:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:05,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:05,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:05,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:05,664 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-08 12:03:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:05,679 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2025-02-08 12:03:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2025-02-08 12:03:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:05,682 INFO L225 Difference]: With dead ends: 86 [2025-02-08 12:03:05,683 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 12:03:05,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:05,683 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:05,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 12:03:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 12:03:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 12:03:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-02-08 12:03:05,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 63 [2025-02-08 12:03:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:05,693 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-02-08 12:03:05,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-08 12:03:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-02-08 12:03:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 12:03:05,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:05,697 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:05,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 12:03:05,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:05,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash -495673347, now seen corresponding path program 1 times [2025-02-08 12:03:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:05,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305689902] [2025-02-08 12:03:05,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:05,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 12:03:05,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 12:03:05,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 12:03:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305689902] [2025-02-08 12:03:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305689902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:03:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232874140] [2025-02-08 12:03:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:05,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:03:05,783 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-08 12:03:05,785 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-08 12:03:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 12:03:05,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 12:03:05,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:05,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:03:05,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:03:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 12:03:05,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:03:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232874140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:03:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 12:03:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687408894] [2025-02-08 12:03:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:05,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:05,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:05,871 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-08 12:03:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:05,879 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-02-08 12:03:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2025-02-08 12:03:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:05,880 INFO L225 Difference]: With dead ends: 69 [2025-02-08 12:03:05,880 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 12:03:05,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:05,881 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:05,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 12:03:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 12:03:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 12:03:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-02-08 12:03:05,885 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 71 [2025-02-08 12:03:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:05,885 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-02-08 12:03:05,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-08 12:03:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-02-08 12:03:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 12:03:05,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:05,887 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:05,893 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-08 12:03:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:06,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2049385194, now seen corresponding path program 1 times [2025-02-08 12:03:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976533004] [2025-02-08 12:03:06,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 12:03:06,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 12:03:06,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:06,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 12:03:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976533004] [2025-02-08 12:03:06,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976533004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:06,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:03:06,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:03:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029928278] [2025-02-08 12:03:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:06,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:03:06,171 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 12:03:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:06,181 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2025-02-08 12:03:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:06,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2025-02-08 12:03:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:06,183 INFO L225 Difference]: With dead ends: 62 [2025-02-08 12:03:06,183 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 12:03:06,183 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-08 12:03:06,183 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:06,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 12:03:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 12:03:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 12:03:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-02-08 12:03:06,187 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 78 [2025-02-08 12:03:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-02-08 12:03:06,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 12:03:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-02-08 12:03:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 12:03:06,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:03:06,188 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 12:03:06,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:03:06,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:03:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -306574859, now seen corresponding path program 1 times [2025-02-08 12:03:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:03:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285219246] [2025-02-08 12:03:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:03:06,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 12:03:06,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 12:03:06,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:06,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 12:03:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:03:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285219246] [2025-02-08 12:03:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285219246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:03:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451106867] [2025-02-08 12:03:06,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:03:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:03:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:03:06,236 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-08 12:03:06,240 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-08 12:03:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 12:03:06,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 12:03:06,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:03:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:03:06,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:03:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:03:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 12:03:06,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:03:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451106867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:03:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:03:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 12:03:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574296740] [2025-02-08 12:03:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:03:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:03:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:03:06,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:03:06,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:06,322 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 12:03:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:03:06,326 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-02-08 12:03:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:03:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2025-02-08 12:03:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:03:06,327 INFO L225 Difference]: With dead ends: 58 [2025-02-08 12:03:06,327 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 12:03:06,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:03:06,328 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:03:06,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:03:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 12:03:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 12:03:06,329 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-08 12:03:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 12:03:06,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-02-08 12:03:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:03:06,329 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 12:03:06,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 12:03:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 12:03:06,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 12:03:06,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 12:03:06,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 12:03:06,339 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-08 12:03:06,533 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,SelfDestructingSolverStorable10 [2025-02-08 12:03:06,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:03:06,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 12:03:06,565 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:03:06,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:03:06 BoogieIcfgContainer [2025-02-08 12:03:06,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:03:06,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:03:06,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:03:06,570 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:03:06,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:03:03" (3/4) ... [2025-02-08 12:03:06,572 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 12:03:06,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 12:03:06,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-02-08 12:03:06,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 12:03:06,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-02-08 12:03:06,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 12:03:06,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 12:03:06,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 12:03:06,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 12:03:06,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 12:03:06,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 12:03:06,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:03:06,632 INFO L158 Benchmark]: Toolchain (without parser) took 3907.73ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 62.9MB in the end (delta: 46.7MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,632 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:03:06,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.15ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 50.2MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.66ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 47.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,632 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 46.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:03:06,633 INFO L158 Benchmark]: IcfgBuilder took 360.00ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 98.1MB in the end (delta: -51.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,633 INFO L158 Benchmark]: TraceAbstraction took 2756.13ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 69.8MB in the end (delta: 28.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,633 INFO L158 Benchmark]: Witness Printer took 61.55ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 62.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:03:06,634 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.51ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.15ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 50.2MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.66ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 47.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 46.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.00ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 98.1MB in the end (delta: -51.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2756.13ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 69.8MB in the end (delta: 28.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 61.55ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 62.9MB in the end (delta: 6.9MB). 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: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: 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 5 procedures, 78 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 2119 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1334 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 785 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 11 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 739 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 470/480 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 12:03:06,658 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