./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_65_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 cb50b07f45f7de45e7a4ed68632423467b7b4045e626d80f3898045079333592 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 16:37:08,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 16:37:08,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 16:37:08,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 16:37:08,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 16:37:08,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 16:37:08,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 16:37:08,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 16:37:08,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 16:37:08,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 16:37:08,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 16:37:08,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 16:37:08,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 16:37:08,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 16:37:08,146 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 16:37:08,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 16:37:08,147 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 16:37:08,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 16:37:08,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:37:08,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 16:37:08,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 16:37:08,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 16:37:08,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 16:37:08,150 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 -> cb50b07f45f7de45e7a4ed68632423467b7b4045e626d80f3898045079333592 [2025-02-06 16:37:08,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 16:37:08,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 16:37:08,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 16:37:08,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 16:37:08,443 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 16:37:08,445 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_65_good.i [2025-02-06 16:37:09,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9e3663d5/d626e14c5a3b4feabf9ed1fa63a310a2/FLAGddc3e25d7 [2025-02-06 16:37:10,136 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 16:37:10,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_65_good.i [2025-02-06 16:37:10,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9e3663d5/d626e14c5a3b4feabf9ed1fa63a310a2/FLAGddc3e25d7 [2025-02-06 16:37:10,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9e3663d5/d626e14c5a3b4feabf9ed1fa63a310a2 [2025-02-06 16:37:10,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 16:37:10,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 16:37:10,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 16:37:10,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 16:37:10,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 16:37:10,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:10" (1/1) ... [2025-02-06 16:37:10,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d98f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:10, skipping insertion in model container [2025-02-06 16:37:10,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:10" (1/1) ... [2025-02-06 16:37:10,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 16:37:10,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:37:10,827 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 16:37:10,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:37:11,040 INFO L204 MainTranslator]: Completed translation [2025-02-06 16:37:11,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11 WrapperNode [2025-02-06 16:37:11,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 16:37:11,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 16:37:11,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 16:37:11,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 16:37:11,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,104 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2025-02-06 16:37:11,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 16:37:11,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 16:37:11,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 16:37:11,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 16:37:11,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,137 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 16:37:11,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 16:37:11,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 16:37:11,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 16:37:11,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 16:37:11,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (1/1) ... [2025-02-06 16:37:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:37:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:37:11,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 16:37:11,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 16:37:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 16:37:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 16:37:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 16:37:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 16:37:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 16:37:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 16:37:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 16:37:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 16:37:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 16:37:11,378 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 16:37:11,380 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 16:37:11,511 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-06 16:37:11,511 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 16:37:11,521 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 16:37:11,522 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 16:37:11,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:11 BoogieIcfgContainer [2025-02-06 16:37:11,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 16:37:11,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 16:37:11,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 16:37:11,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 16:37:11,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:37:10" (1/3) ... [2025-02-06 16:37:11,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d9525c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:11, skipping insertion in model container [2025-02-06 16:37:11,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:11" (2/3) ... [2025-02-06 16:37:11,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d9525c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:11, skipping insertion in model container [2025-02-06 16:37:11,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:11" (3/3) ... [2025-02-06 16:37:11,535 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_postinc_65_good.i [2025-02-06 16:37:11,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 16:37:11,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_postinc_65_good.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-06 16:37:11,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 16:37:11,633 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;@7c82a949, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 16:37:11,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 16:37:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 16:37:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 16:37:11,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:37:11,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:37:11,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 16:37:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:37:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1337517230, now seen corresponding path program 1 times [2025-02-06 16:37:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:37:11,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820515676] [2025-02-06 16:37:11,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:37:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:37:11,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 16:37:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 16:37:11,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:37:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:37:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:37:12,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:37:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820515676] [2025-02-06 16:37:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820515676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:37:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:37:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 16:37:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140499956] [2025-02-06 16:37:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:37:12,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 16:37:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:37:12,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 16:37:12,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:37:12,048 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:37:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:37:12,151 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-02-06 16:37:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 16:37:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 16:37:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:37:12,162 INFO L225 Difference]: With dead ends: 61 [2025-02-06 16:37:12,162 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 16:37:12,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 16:37:12,168 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:37:12,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 214 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:37:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 16:37:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-02-06 16:37:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 16:37:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-02-06 16:37:12,204 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 12 [2025-02-06 16:37:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:37:12,206 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-02-06 16:37:12,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:37:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-02-06 16:37:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 16:37:12,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:37:12,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:37:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 16:37:12,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 16:37:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:37:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1486646802, now seen corresponding path program 1 times [2025-02-06 16:37:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:37:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326953252] [2025-02-06 16:37:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:37:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:37:12,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 16:37:12,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 16:37:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:37:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:37:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:37:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:37:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326953252] [2025-02-06 16:37:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326953252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:37:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:37:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 16:37:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095669544] [2025-02-06 16:37:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:37:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 16:37:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:37:12,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 16:37:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 16:37:12,374 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:37:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:37:12,456 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-02-06 16:37:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 16:37:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-06 16:37:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:37:12,457 INFO L225 Difference]: With dead ends: 61 [2025-02-06 16:37:12,457 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 16:37:12,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 16:37:12,458 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:37:12,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:37:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 16:37:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 16:37:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 16:37:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-02-06 16:37:12,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 13 [2025-02-06 16:37:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:37:12,464 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-02-06 16:37:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:37:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-02-06 16:37:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 16:37:12,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:37:12,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:37:12,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 16:37:12,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 16:37:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:37:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 822580238, now seen corresponding path program 1 times [2025-02-06 16:37:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:37:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250776532] [2025-02-06 16:37:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:37:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:37:12,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 16:37:12,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 16:37:12,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:37:12,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:37:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:37:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:37:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250776532] [2025-02-06 16:37:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250776532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:37:12,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:37:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 16:37:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389335356] [2025-02-06 16:37:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:37:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 16:37:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:37:12,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 16:37:12,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:37:12,640 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:37:12,689 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-02-06 16:37:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 16:37:12,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-02-06 16:37:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:37:12,690 INFO L225 Difference]: With dead ends: 40 [2025-02-06 16:37:12,690 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 16:37:12,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 16:37:12,691 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:37:12,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 165 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:37:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 16:37:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 16:37:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 16:37:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-02-06 16:37:12,703 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 26 [2025-02-06 16:37:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:37:12,703 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-02-06 16:37:12,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-02-06 16:37:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 16:37:12,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:37:12,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:37:12,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 16:37:12,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 16:37:12,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:37:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash -269816394, now seen corresponding path program 1 times [2025-02-06 16:37:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:37:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141763733] [2025-02-06 16:37:12,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:37:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:37:12,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 16:37:12,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 16:37:12,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:37:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:37:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:37:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:37:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141763733] [2025-02-06 16:37:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141763733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:37:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:37:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 16:37:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096413822] [2025-02-06 16:37:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:37:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:37:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:37:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:37:12,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:37:12,847 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:37:12,872 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-02-06 16:37:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:37:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-06 16:37:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:37:12,876 INFO L225 Difference]: With dead ends: 41 [2025-02-06 16:37:12,877 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 16:37:12,877 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-06 16:37:12,878 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:37:12,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:37:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 16:37:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-06 16:37:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 16:37:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-06 16:37:12,891 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2025-02-06 16:37:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:37:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-06 16:37:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-06 16:37:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 16:37:12,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:37:12,892 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:37:12,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 16:37:12,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 16:37:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:37:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -269824370, now seen corresponding path program 1 times [2025-02-06 16:37:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:37:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892485665] [2025-02-06 16:37:12,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:37:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:37:12,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 16:37:12,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 16:37:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:37:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:37:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:37:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:37:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892485665] [2025-02-06 16:37:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892485665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:37:13,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:37:13,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 16:37:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366999414] [2025-02-06 16:37:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:37:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 16:37:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:37:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 16:37:13,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 16:37:13,013 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:37:13,065 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-06 16:37:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 16:37:13,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-06 16:37:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:37:13,066 INFO L225 Difference]: With dead ends: 36 [2025-02-06 16:37:13,066 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 16:37:13,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 16:37:13,067 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:37:13,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:37:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 16:37:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 16:37:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 16:37:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 16:37:13,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-02-06 16:37:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:37:13,069 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 16:37:13,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:37:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 16:37:13,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 16:37:13,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 16:37:13,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 16:37:13,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 16:37:13,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 16:37:13,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 16:37:13,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 16:37:13,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 16:37:13,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 16:37:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:37:13 BoogieIcfgContainer [2025-02-06 16:37:13,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 16:37:13,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 16:37:13,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 16:37:13,221 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 16:37:13,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:11" (3/4) ... [2025-02-06 16:37:13,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 16:37:13,230 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 16:37:13,230 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 16:37:13,230 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-02-06 16:37:13,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-06 16:37:13,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 16:37:13,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 16:37:13,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 16:37:13,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 16:37:13,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 16:37:13,294 INFO L158 Benchmark]: Toolchain (without parser) took 3113.48ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 49.3MB in the end (delta: 52.2MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2025-02-06 16:37:13,294 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:37:13,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.16ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 41.8MB in the end (delta: 59.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 16:37:13,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.87ms. Allocated memory is still 142.6MB. Free memory was 41.8MB in the beginning and 38.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:37:13,294 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 142.6MB. Free memory was 38.7MB in the beginning and 37.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:37:13,295 INFO L158 Benchmark]: IcfgBuilder took 363.60ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 94.4MB in the end (delta: -56.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-02-06 16:37:13,295 INFO L158 Benchmark]: TraceAbstraction took 1695.03ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 55.1MB in the end (delta: 38.5MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2025-02-06 16:37:13,295 INFO L158 Benchmark]: Witness Printer took 71.97ms. Allocated memory is still 142.6MB. Free memory was 55.1MB in the beginning and 49.3MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:37:13,297 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 859.16ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 41.8MB in the end (delta: 59.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.87ms. Allocated memory is still 142.6MB. Free memory was 41.8MB in the beginning and 38.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 142.6MB. Free memory was 38.7MB in the beginning and 37.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.60ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 94.4MB in the end (delta: -56.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1695.03ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 55.1MB in the end (delta: 38.5MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * Witness Printer took 71.97ms. Allocated memory is still 142.6MB. Free memory was 55.1MB in the beginning and 49.3MB in the end (delta: 5.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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 177 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9/9 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 16:37:13,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE