./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_44_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/CWE191_Integer_Underflow__int_rand_predec_44_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 ff2100b57ba1af733b18b0ed01e5612337c89783713c65e87d346ed39457ac58 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:23:32,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:23:32,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:23:32,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:23:32,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:23:32,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:23:32,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:23:32,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:23:32,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:23:32,927 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:23:32,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:23:32,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:23:32,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:23:32,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:23:32,928 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:23:32,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:23:32,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:23:32,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:23:32,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:23:32,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:23:32,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:23:32,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:23:32,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:23:32,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:23:32,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:23:32,931 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 -> ff2100b57ba1af733b18b0ed01e5612337c89783713c65e87d346ed39457ac58 [2025-02-08 13:23:33,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:23:33,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:23:33,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:23:33,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:23:33,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:23:33,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_44_good.i [2025-02-08 13:23:34,310 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/299d0d98a/abc0fa91155e4e63ad12576faa5fcbd8/FLAG10b9eba23 [2025-02-08 13:23:34,600 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:23:34,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_44_good.i [2025-02-08 13:23:34,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/299d0d98a/abc0fa91155e4e63ad12576faa5fcbd8/FLAG10b9eba23 [2025-02-08 13:23:34,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/299d0d98a/abc0fa91155e4e63ad12576faa5fcbd8 [2025-02-08 13:23:34,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:23:34,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:23:34,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:23:34,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:23:34,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:23:34,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:23:34" (1/1) ... [2025-02-08 13:23:34,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:34, skipping insertion in model container [2025-02-08 13:23:34,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:23:34" (1/1) ... [2025-02-08 13:23:34,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:23:35,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:23:35,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:23:35,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:23:35,653 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:23:35,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35 WrapperNode [2025-02-08 13:23:35,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:23:35,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:23:35,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:23:35,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:23:35,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,705 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2025-02-08 13:23:35,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:23:35,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:23:35,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:23:35,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:23:35,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,726 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 13:23:35,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:23:35,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:23:35,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:23:35,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:23:35,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (1/1) ... [2025-02-08 13:23:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:23:35,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:23:35,758 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 13:23:35,775 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 13:23:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 13:23:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 13:23:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 13:23:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 13:23:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:23:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 13:23:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 13:23:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:23:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:23:35,885 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:23:35,886 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:23:36,046 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-08 13:23:36,047 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:23:36,066 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:23:36,067 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:23:36,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:23:36 BoogieIcfgContainer [2025-02-08 13:23:36,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:23:36,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:23:36,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:23:36,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:23:36,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:23:34" (1/3) ... [2025-02-08 13:23:36,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514b6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:23:36, skipping insertion in model container [2025-02-08 13:23:36,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:23:35" (2/3) ... [2025-02-08 13:23:36,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514b6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:23:36, skipping insertion in model container [2025-02-08 13:23:36,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:23:36" (3/3) ... [2025-02-08 13:23:36,075 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_44_good.i [2025-02-08 13:23:36,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:23:36,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_predec_44_good.i that has 4 procedures, 59 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 13:23:36,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:23:36,135 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;@300256f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:23:36,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 13:23:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 49 states have internal predecessors, (64), 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-08 13:23:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:23:36,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:36,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:23:36,150 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 13:23:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2086934498, now seen corresponding path program 1 times [2025-02-08 13:23:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-02-08 13:23:36,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:23:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:23:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:36,366 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 13:23:36,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-02-08 13:23:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728669154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:23:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41344574] [2025-02-08 13:23:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:23:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:36,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:23:36,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:23:36,384 INFO L87 Difference]: Start difference. First operand has 59 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 49 states have internal predecessors, (64), 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.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 13:23:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:36,476 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2025-02-08 13:23:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:23:36,478 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 13:23:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:36,485 INFO L225 Difference]: With dead ends: 78 [2025-02-08 13:23:36,486 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 13:23:36,488 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 13:23:36,490 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:36,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:23:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 13:23:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-02-08 13:23:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 52 states have internal predecessors, (70), 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 13:23:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2025-02-08 13:23:36,523 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 11 [2025-02-08 13:23:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:36,524 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2025-02-08 13:23:36,524 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 13:23:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2025-02-08 13:23:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:23:36,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:36,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:23:36,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:23:36,525 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 13:23:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 270453084, now seen corresponding path program 1 times [2025-02-08 13:23:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-02-08 13:23:36,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:36,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:23:36,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:23:36,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:36,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:36,581 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 13:23:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-02-08 13:23:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297628439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:23:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083791467] [2025-02-08 13:23:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:23:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:36,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:23:36,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:23:36,585 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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 13:23:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:36,609 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2025-02-08 13:23:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:23:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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 13:23:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:36,612 INFO L225 Difference]: With dead ends: 61 [2025-02-08 13:23:36,612 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 13:23:36,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:23:36,612 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:36,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:23:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 13:23:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 13:23:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 51 states have internal predecessors, (68), 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 13:23:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-02-08 13:23:36,620 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 12 [2025-02-08 13:23:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:36,620 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-02-08 13:23:36,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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 13:23:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-02-08 13:23:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:23:36,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:36,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:23:36,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:23:36,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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 13:23:36,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash 270460036, now seen corresponding path program 1 times [2025-02-08 13:23:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:36,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792526347] [2025-02-08 13:23:36,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:36,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:23:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:23:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:36,740 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 13:23:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792526347] [2025-02-08 13:23:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792526347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:36,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:36,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:23:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824372870] [2025-02-08 13:23:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:36,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:23:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:36,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:23:36,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:23:36,746 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. 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-08 13:23:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:36,869 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-02-08 13:23:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:23:36,871 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-08 13:23:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:36,871 INFO L225 Difference]: With dead ends: 62 [2025-02-08 13:23:36,871 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 13:23:36,872 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 13:23:36,873 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:36,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 292 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:23:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 13:23:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-02-08 13:23:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 51 states have internal predecessors, (67), 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 13:23:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2025-02-08 13:23:36,887 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 12 [2025-02-08 13:23:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2025-02-08 13:23:36,887 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-08 13:23:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2025-02-08 13:23:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 13:23:36,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:36,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:23:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:23:36,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 13:23:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -205888960, now seen corresponding path program 1 times [2025-02-08 13:23:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461205832] [2025-02-08 13:23:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:36,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 13:23:36,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 13:23:36,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:36,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:37,003 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 13:23:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461205832] [2025-02-08 13:23:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461205832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:23:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390495631] [2025-02-08 13:23:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:23:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:37,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:23:37,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:23:37,009 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-08 13:23:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:37,046 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2025-02-08 13:23:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:23:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-08 13:23:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:37,048 INFO L225 Difference]: With dead ends: 103 [2025-02-08 13:23:37,052 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 13:23:37,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 13:23:37,053 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:37,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 162 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:23:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 13:23:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 13:23:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.372093023255814) internal successors, (59), 45 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:23:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-02-08 13:23:37,063 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 13 [2025-02-08 13:23:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:37,063 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-02-08 13:23:37,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-08 13:23:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-02-08 13:23:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 13:23:37,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:37,064 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, 1, 1, 1, 1] [2025-02-08 13:23:37,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:23:37,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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 13:23:37,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1497288963, now seen corresponding path program 1 times [2025-02-08 13:23:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374509025] [2025-02-08 13:23:37,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:37,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 13:23:37,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 13:23:37,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:37,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:37,186 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 13:23:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374509025] [2025-02-08 13:23:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374509025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:37,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:23:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723710976] [2025-02-08 13:23:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:23:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:37,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:23:37,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:23:37,188 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 13:23:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:37,203 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-08 13:23:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:23:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 30 [2025-02-08 13:23:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:37,208 INFO L225 Difference]: With dead ends: 53 [2025-02-08 13:23:37,208 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 13:23:37,208 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 13:23:37,209 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:37,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 129 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:23:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 13:23:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 13:23:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:23:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-02-08 13:23:37,212 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 30 [2025-02-08 13:23:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:37,213 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-02-08 13:23:37,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 13:23:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-02-08 13:23:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 13:23:37,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:23:37,213 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, 1, 1, 1, 1] [2025-02-08 13:23:37,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:23:37,214 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 13:23:37,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:23:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash 80434977, now seen corresponding path program 1 times [2025-02-08 13:23:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:23:37,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-02-08 13:23:37,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:23:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:23:37,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 13:23:37,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 13:23:37,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:23:37,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:23:37,327 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 13:23:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:23:37,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-02-08 13:23:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005088799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:23:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:23:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:23:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997476954] [2025-02-08 13:23:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:23:37,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:23:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:23:37,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:23:37,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:23:37,329 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 13:23:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:23:37,368 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-02-08 13:23:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:23:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 32 [2025-02-08 13:23:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:23:37,369 INFO L225 Difference]: With dead ends: 49 [2025-02-08 13:23:37,369 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:23:37,369 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 13:23:37,370 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:23:37,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 259 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:23:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:23:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:23:37,371 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 13:23:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:23:37,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-02-08 13:23:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:23:37,371 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:23:37,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 13:23:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:23:37,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:23:37,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 13:23:37,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 13:23:37,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 13:23:37,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 13:23:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:23:37,376 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 13:23:37,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:23:37,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:23:37,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:23:37 BoogieIcfgContainer [2025-02-08 13:23:37,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:23:37,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:23:37,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:23:37,510 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:23:37,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:23:36" (3/4) ... [2025-02-08 13:23:37,512 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:23:37,516 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 13:23:37,516 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 13:23:37,517 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-02-08 13:23:37,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 13:23:37,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 13:23:37,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 13:23:37,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:23:37,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:23:37,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:23:37,571 INFO L158 Benchmark]: Toolchain (without parser) took 2711.43ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 80.4MB in the end (delta: 28.5MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-02-08 13:23:37,571 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:23:37,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.80ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 47.5MB in the end (delta: 61.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 13:23:37,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.24ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:23:37,571 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 43.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:23:37,571 INFO L158 Benchmark]: IcfgBuilder took 332.79ms. Allocated memory is still 142.6MB. Free memory was 43.0MB in the beginning and 93.5MB in the end (delta: -50.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-02-08 13:23:37,572 INFO L158 Benchmark]: TraceAbstraction took 1440.51ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 87.5MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:23:37,572 INFO L158 Benchmark]: Witness Printer took 59.73ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 80.4MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:23:37,573 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.80ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 47.5MB in the end (delta: 61.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.24ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 43.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 332.79ms. Allocated memory is still 142.6MB. Free memory was 43.0MB in the beginning and 93.5MB in the end (delta: -50.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1440.51ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 87.5MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.73ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 80.4MB in the end (delta: 6.2MB). 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: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: 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, 59 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 944 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 360 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=1, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5/5 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 13:23:37,584 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