./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_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_fgets_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 24d72a2120f95f3cf22949963a59da230e0fbc143a8b1a1c5541a1b542d02a88 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 11:12:21,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 11:12:21,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 11:12:21,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 11:12:21,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 11:12:21,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 11:12:21,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 11:12:21,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 11:12:21,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 11:12:21,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 11:12:21,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 11:12:21,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 11:12:21,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 11:12:21,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 11:12:21,302 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 11:12:21,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 11:12:21,303 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 11:12:21,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 11:12:21,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:12:21,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 11:12:21,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 11:12:21,305 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 -> 24d72a2120f95f3cf22949963a59da230e0fbc143a8b1a1c5541a1b542d02a88 [2025-02-08 11:12:21,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 11:12:21,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 11:12:21,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 11:12:21,523 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 11:12:21,523 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 11:12:21,524 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_fgets_postinc_65_good.i [2025-02-08 11:12:22,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f817338e5/b938d924908a4a2ab4ec6c62dea372b7/FLAG6e1c0fc65 [2025-02-08 11:12:23,202 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 11:12:23,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_good.i [2025-02-08 11:12:23,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f817338e5/b938d924908a4a2ab4ec6c62dea372b7/FLAG6e1c0fc65 [2025-02-08 11:12:23,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f817338e5/b938d924908a4a2ab4ec6c62dea372b7 [2025-02-08 11:12:23,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 11:12:23,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 11:12:23,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 11:12:23,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 11:12:23,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 11:12:23,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:12:23" (1/1) ... [2025-02-08 11:12:23,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:23, skipping insertion in model container [2025-02-08 11:12:23,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:12:23" (1/1) ... [2025-02-08 11:12:23,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 11:12:24,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:12:24,052 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 11:12:24,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:12:24,171 INFO L204 MainTranslator]: Completed translation [2025-02-08 11:12:24,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24 WrapperNode [2025-02-08 11:12:24,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 11:12:24,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 11:12:24,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 11:12:24,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 11:12:24,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,205 INFO L138 Inliner]: procedures = 503, calls = 36, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2025-02-08 11:12:24,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 11:12:24,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 11:12:24,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 11:12:24,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 11:12:24,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,235 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-02-08 11:12:24,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 11:12:24,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 11:12:24,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 11:12:24,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 11:12:24,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (1/1) ... [2025-02-08 11:12:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:12:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:24,297 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 11:12:24,299 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 11:12:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 11:12:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 11:12:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 11:12:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 11:12:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 11:12:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 11:12:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 11:12:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 11:12:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 11:12:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 11:12:24,442 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 11:12:24,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 11:12:24,553 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-08 11:12:24,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 11:12:24,558 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 11:12:24,559 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 11:12:24,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:24 BoogieIcfgContainer [2025-02-08 11:12:24,559 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 11:12:24,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 11:12:24,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 11:12:24,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 11:12:24,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:12:23" (1/3) ... [2025-02-08 11:12:24,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a37eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:12:24, skipping insertion in model container [2025-02-08 11:12:24,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:24" (2/3) ... [2025-02-08 11:12:24,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a37eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:12:24, skipping insertion in model container [2025-02-08 11:12:24,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:24" (3/3) ... [2025-02-08 11:12:24,565 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_65_good.i [2025-02-08 11:12:24,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 11:12:24,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_65_good.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 11:12:24,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 11:12:24,615 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;@33c33bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 11:12:24,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 11:12:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 11:12:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 11:12:24,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:24,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:24,621 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-08 11:12:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1767597916, now seen corresponding path program 1 times [2025-02-08 11:12:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129062905] [2025-02-08 11:12:24,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 11:12:24,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 11:12:24,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:24,907 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 11:12:24,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129062905] [2025-02-08 11:12:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129062905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 11:12:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910942089] [2025-02-08 11:12:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 11:12:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:24,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 11:12:24,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 11:12:24,923 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-08 11:12:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:24,987 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-08 11:12:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 11:12:24,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 11 [2025-02-08 11:12:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:24,992 INFO L225 Difference]: With dead ends: 59 [2025-02-08 11:12:24,992 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 11:12:24,993 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-08 11:12:24,995 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 211 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-08 11:12:24,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 211 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 11:12:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-08 11:12:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 11:12:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-08 11:12:25,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 11 [2025-02-08 11:12:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:25,023 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-08 11:12:25,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-08 11:12:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-02-08 11:12:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 11:12:25,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:25,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 11:12:25,024 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-08 11:12:25,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1039046432, now seen corresponding path program 1 times [2025-02-08 11:12:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364923897] [2025-02-08 11:12:25,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:25,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 11:12:25,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 11:12:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:25,226 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 11:12:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364923897] [2025-02-08 11:12:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364923897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:25,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:25,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 11:12:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967173982] [2025-02-08 11:12:25,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:25,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 11:12:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:25,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 11:12:25,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 11:12:25,228 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 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-08 11:12:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:25,311 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-02-08 11:12:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 11:12:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 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-08 11:12:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:25,311 INFO L225 Difference]: With dead ends: 65 [2025-02-08 11:12:25,311 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 11:12:25,312 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-08 11:12:25,312 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 181 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-08 11:12:25,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 181 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 11:12:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 11:12:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 32 states have internal predecessors, (34), 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-08 11:12:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-02-08 11:12:25,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2025-02-08 11:12:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:25,317 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-02-08 11:12:25,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 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-08 11:12:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-02-08 11:12:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 11:12:25,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:25,318 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-08 11:12:25,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 11:12:25,319 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-08 11:12:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2118023001, now seen corresponding path program 1 times [2025-02-08 11:12:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754113468] [2025-02-08 11:12:25,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 11:12:25,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 11:12:25,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:25,537 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-08 11:12:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754113468] [2025-02-08 11:12:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754113468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 11:12:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453137161] [2025-02-08 11:12:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 11:12:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:25,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 11:12:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 11:12:25,541 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 5 states have (on average 3.8) 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-08 11:12:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:25,587 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-02-08 11:12:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 11:12:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) 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-08 11:12:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:25,591 INFO L225 Difference]: With dead ends: 41 [2025-02-08 11:12:25,591 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 11:12:25,592 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-08 11:12:25,592 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:12:25,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 176 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 11:12:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 11:12:25,596 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), 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-08 11:12:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-02-08 11:12:25,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2025-02-08 11:12:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:25,597 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-02-08 11:12:25,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) 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-08 11:12:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-02-08 11:12:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 11:12:25,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:25,598 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-08 11:12:25,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 11:12:25,598 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-08 11:12:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1234203588, now seen corresponding path program 1 times [2025-02-08 11:12:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021744325] [2025-02-08 11:12:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 11:12:25,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 11:12:25,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:25,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:25,694 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-08 11:12:25,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:25,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021744325] [2025-02-08 11:12:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021744325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:25,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:25,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 11:12:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151471908] [2025-02-08 11:12:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 11:12:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:25,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 11:12:25,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:12:25,695 INFO L87 Difference]: Start difference. First operand 40 states and 44 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, (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-08 11:12:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:25,713 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-02-08 11:12:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 11:12:25,714 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, (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-08 11:12:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:25,715 INFO L225 Difference]: With dead ends: 42 [2025-02-08 11:12:25,715 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 11:12:25,715 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 11:12:25,716 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 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 11:12:25,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 11:12:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-02-08 11:12:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 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-08 11:12:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-02-08 11:12:25,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2025-02-08 11:12:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:25,721 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-02-08 11:12:25,721 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, (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-08 11:12:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-02-08 11:12:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 11:12:25,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:25,721 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-08 11:12:25,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 11:12:25,722 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-08 11:12:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1234210571, now seen corresponding path program 1 times [2025-02-08 11:12:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994356781] [2025-02-08 11:12:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:25,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 11:12:25,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 11:12:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:25,830 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-08 11:12:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994356781] [2025-02-08 11:12:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994356781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:25,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 11:12:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071001851] [2025-02-08 11:12:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:25,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 11:12:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 11:12:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 11:12:25,834 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) 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-08 11:12:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:25,892 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-02-08 11:12:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 11:12:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) 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-08 11:12:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:25,893 INFO L225 Difference]: With dead ends: 37 [2025-02-08 11:12:25,894 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 11:12:25,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 11:12:25,894 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:12:25,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 191 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 11:12:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 11:12:25,898 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), 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-08 11:12:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-08 11:12:25,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2025-02-08 11:12:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:25,899 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-08 11:12:25,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) 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-08 11:12:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-08 11:12:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 11:12:25,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:25,900 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, 1] [2025-02-08 11:12:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 11:12:25,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr0ASSERT_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-08 11:12:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 394177956, now seen corresponding path program 1 times [2025-02-08 11:12:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:12:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577743473] [2025-02-08 11:12:25,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:12:25,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 11:12:25,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 11:12:25,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:25,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 11:12:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:12:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577743473] [2025-02-08 11:12:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577743473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 11:12:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38844655] [2025-02-08 11:12:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:26,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:12:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:12:26,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:12:26,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:12:26,010 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 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-08 11:12:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:26,019 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-02-08 11:12:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:12:26,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 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 28 [2025-02-08 11:12:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:26,020 INFO L225 Difference]: With dead ends: 36 [2025-02-08 11:12:26,020 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 11:12:26,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 11:12:26,021 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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 11:12:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 11:12:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 11:12:26,021 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 11:12:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 11:12:26,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-02-08 11:12:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 11:12:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 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-08 11:12:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 11:12:26,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 11:12:26,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 11:12:26,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 11:12:26,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 11:12:26,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 11:12:26,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 11:12:26,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 11:12:26,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 11:12:26,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 11:12:26,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:12:26 BoogieIcfgContainer [2025-02-08 11:12:26,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 11:12:26,121 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 11:12:26,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 11:12:26,121 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 11:12:26,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:24" (3/4) ... [2025-02-08 11:12:26,123 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 11:12:26,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 11:12:26,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 11:12:26,128 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-02-08 11:12:26,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 11:12:26,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 11:12:26,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 11:12:26,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 11:12:26,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 11:12:26,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 11:12:26,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 11:12:26,190 INFO L158 Benchmark]: Toolchain (without parser) took 2913.91ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 73.0MB in the end (delta: 29.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,191 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:12:26,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.68ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 42.2MB in the end (delta: 60.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.32ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,192 INFO L158 Benchmark]: Boogie Preprocessor took 35.97ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 37.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:12:26,192 INFO L158 Benchmark]: IcfgBuilder took 317.31ms. Allocated memory is still 142.6MB. Free memory was 37.1MB in the beginning and 92.5MB in the end (delta: -55.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,193 INFO L158 Benchmark]: TraceAbstraction took 1560.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 80.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,193 INFO L158 Benchmark]: Witness Printer took 67.98ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 73.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 11:12:26,194 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.18ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.68ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 42.2MB in the end (delta: 60.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.32ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.97ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 37.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.31ms. Allocated memory is still 142.6MB. Free memory was 37.1MB in the beginning and 92.5MB in the end (delta: -55.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1560.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 80.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Witness Printer took 67.98ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 73.0MB in the end (delta: 7.0MB). 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: 1601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: 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, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 912 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 221 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=1, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 11/11 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-08 11:12:26,210 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