./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_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 ecc2c5e2dc21d25a9fe59df59b6040ac8b2c60fe123e1cc4e1c3fac9857dd37f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:23:36,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:23:36,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:23:36,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:23:36,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:23:36,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:23:36,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:23:36,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:23:36,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:23:36,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:23:36,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:23:36,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:23:36,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:23:36,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:23:36,174 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:23:36,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:23:36,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:23:36,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:23:36,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:23:36,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:23:36,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:23:36,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:23:36,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:23:36,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:23:36,176 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 -> ecc2c5e2dc21d25a9fe59df59b6040ac8b2c60fe123e1cc4e1c3fac9857dd37f [2025-02-06 17:23:36,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:23:36,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:23:36,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:23:36,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:23:36,428 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:23:36,433 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_fgets_postdec_65_good.i [2025-02-06 17:23:37,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af48b6e1c/cb46f0e299664ffa86a08361a19fc95b/FLAGc8ce009dd [2025-02-06 17:23:38,050 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:23:38,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_65_good.i [2025-02-06 17:23:38,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af48b6e1c/cb46f0e299664ffa86a08361a19fc95b/FLAGc8ce009dd [2025-02-06 17:23:38,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af48b6e1c/cb46f0e299664ffa86a08361a19fc95b [2025-02-06 17:23:38,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:23:38,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:23:38,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:23:38,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:23:38,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:23:38,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f16ac5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38, skipping insertion in model container [2025-02-06 17:23:38,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:23:38,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:23:38,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:23:38,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:23:38,937 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:23:38,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38 WrapperNode [2025-02-06 17:23:38,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:23:38,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:23:38,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:23:38,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:23:38,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,983 INFO L138 Inliner]: procedures = 503, calls = 36, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2025-02-06 17:23:38,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:23:38,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:23:38,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:23:38,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:23:38,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:38,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,009 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-06 17:23:39,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:23:39,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:23:39,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:23:39,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:23:39,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (1/1) ... [2025-02-06 17:23:39,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:23:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:23:39,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 17:23:39,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 17:23:39,084 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 17:23:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 17:23:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 17:23:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 17:23:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:23:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 17:23:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 17:23:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:23:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:23:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 17:23:39,194 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:23:39,197 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:23:39,363 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-06 17:23:39,363 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:23:39,374 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:23:39,378 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:23:39,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:23:39 BoogieIcfgContainer [2025-02-06 17:23:39,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:23:39,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:23:39,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:23:39,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:23:39,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:23:38" (1/3) ... [2025-02-06 17:23:39,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:23:39, skipping insertion in model container [2025-02-06 17:23:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:23:38" (2/3) ... [2025-02-06 17:23:39,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:23:39, skipping insertion in model container [2025-02-06 17:23:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:23:39" (3/3) ... [2025-02-06 17:23:39,390 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_65_good.i [2025-02-06 17:23:39,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:23:39,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_postdec_65_good.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-06 17:23:39,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:23:39,511 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;@7db61af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:23:39,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 17:23:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 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-06 17:23:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:23:39,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:39,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:23:39,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 17:23:39,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2042419356, now seen corresponding path program 1 times [2025-02-06 17:23:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054870829] [2025-02-06 17:23:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:39,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:23:39,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:23:39,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:39,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054870829] [2025-02-06 17:23:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054870829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:39,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 17:23:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223793218] [2025-02-06 17:23:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:23:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:39,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:23:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:23:39,891 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 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.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:39,977 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-06 17:23:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:23:39,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 17:23:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:39,983 INFO L225 Difference]: With dead ends: 64 [2025-02-06 17:23:39,984 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 17:23:39,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:23:39,989 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:39,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 228 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 17:23:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-02-06 17:23:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 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-06 17:23:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-06 17:23:40,024 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 12 [2025-02-06 17:23:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,025 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-06 17:23:40,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-06 17:23:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:23:40,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:40,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:23:40,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:23:40,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 17:23:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1109501436, now seen corresponding path program 1 times [2025-02-06 17:23:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:40,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433838607] [2025-02-06 17:23:40,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:40,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:23:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:23:40,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433838607] [2025-02-06 17:23:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433838607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:23:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159522219] [2025-02-06 17:23:40,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:40,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:23:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:40,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:23:40,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:23:40,099 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-06 17:23:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:40,111 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-02-06 17:23:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:23:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2025-02-06 17:23:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:40,115 INFO L225 Difference]: With dead ends: 44 [2025-02-06 17:23:40,115 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 17:23:40,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:23:40,116 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:40,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 17:23:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 17:23:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 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-06 17:23:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-06 17:23:40,123 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 13 [2025-02-06 17:23:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,124 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-06 17:23:40,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-06 17:23:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-06 17:23:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:23:40,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:40,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:23:40,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 17:23:40,125 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-06 17:23:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1109509412, now seen corresponding path program 1 times [2025-02-06 17:23:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123264322] [2025-02-06 17:23:40,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:23:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:23:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123264322] [2025-02-06 17:23:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123264322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 17:23:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209671772] [2025-02-06 17:23:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:40,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:23:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:40,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:23:40,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:23:40,247 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:40,303 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-06 17:23:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:23:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-06 17:23:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:40,304 INFO L225 Difference]: With dead ends: 45 [2025-02-06 17:23:40,304 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 17:23:40,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:23:40,305 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:40,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 171 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 17:23:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-02-06 17:23:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 34 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-06 17:23:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-02-06 17:23:40,315 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 13 [2025-02-06 17:23:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-02-06 17:23:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-02-06 17:23:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 17:23:40,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:40,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:23:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:23:40,316 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-06 17:23:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 34806145, now seen corresponding path program 1 times [2025-02-06 17:23:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534811503] [2025-02-06 17:23:40,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:40,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 17:23:40,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 17:23:40,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:40,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534811503] [2025-02-06 17:23:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534811503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:23:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720632392] [2025-02-06 17:23:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:40,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:23:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:40,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:23:40,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:23:40,413 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:40,437 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-06 17:23:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:23:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2025-02-06 17:23:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:40,437 INFO L225 Difference]: With dead ends: 67 [2025-02-06 17:23:40,437 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 17:23:40,438 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-06 17:23:40,438 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:40,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 17:23:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 17:23:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:23:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-06 17:23:40,449 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2025-02-06 17:23:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,450 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-06 17:23:40,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:23:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-06 17:23:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 17:23:40,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:40,450 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] [2025-02-06 17:23:40,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 17:23:40,450 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-06 17:23:40,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1767260225, now seen corresponding path program 1 times [2025-02-06 17:23:40,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:40,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548314778] [2025-02-06 17:23:40,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:40,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:40,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 17:23:40,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 17:23:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:40,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:40,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548314778] [2025-02-06 17:23:40,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548314778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:23:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173958358] [2025-02-06 17:23:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:40,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:23:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:40,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:23:40,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:23:40,631 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 17:23:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:40,650 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-06 17:23:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:23:40,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 28 [2025-02-06 17:23:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:40,652 INFO L225 Difference]: With dead ends: 36 [2025-02-06 17:23:40,652 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 17:23:40,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:23:40,652 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:40,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 17:23:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 17:23:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:23:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-06 17:23:40,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2025-02-06 17:23:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,662 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-06 17:23:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 17:23:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-06 17:23:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:23:40,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:23:40,663 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] [2025-02-06 17:23:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 17:23:40,664 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-06 17:23:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:23:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1824747294, now seen corresponding path program 1 times [2025-02-06 17:23:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:23:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971460702] [2025-02-06 17:23:40,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:23:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:23:40,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:23:40,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:23:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:23:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:23:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:23:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:23:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971460702] [2025-02-06 17:23:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971460702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:23:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:23:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 17:23:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693505194] [2025-02-06 17:23:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:23:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:23:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:23:40,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:23:40,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:23:40,803 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-06 17:23:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:23:40,845 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-02-06 17:23:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 17:23:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-06 17:23:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:23:40,846 INFO L225 Difference]: With dead ends: 32 [2025-02-06 17:23:40,846 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 17:23:40,847 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-06 17:23:40,847 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:23:40,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:23:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 17:23:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 17:23:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:23:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 17:23:40,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-02-06 17:23:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:23:40,848 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 17:23:40,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-06 17:23:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 17:23:40,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 17:23:40,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 17:23:40,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 17:23:40,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 17:23:40,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 17:23:40,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:23:40,853 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 17:23:40,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 17:23:40,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 17:23:40,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:23:40 BoogieIcfgContainer [2025-02-06 17:23:40,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 17:23:40,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 17:23:40,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 17:23:40,992 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 17:23:40,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:23:39" (3/4) ... [2025-02-06 17:23:40,994 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 17:23:40,998 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 17:23:40,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 17:23:40,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-02-06 17:23:41,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-06 17:23:41,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 17:23:41,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 17:23:41,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 17:23:41,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 17:23:41,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 17:23:41,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 17:23:41,099 INFO L158 Benchmark]: Toolchain (without parser) took 2849.29ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 97.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-02-06 17:23:41,099 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 192.9MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:23:41,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.37ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 46.4MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 17:23:41,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.71ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 43.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:23:41,103 INFO L158 Benchmark]: Boogie Preprocessor took 42.17ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:23:41,103 INFO L158 Benchmark]: IcfgBuilder took 352.02ms. Allocated memory is still 142.6MB. Free memory was 42.1MB in the beginning and 96.7MB in the end (delta: -54.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-02-06 17:23:41,103 INFO L158 Benchmark]: TraceAbstraction took 1612.01ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 103.2MB in the end (delta: -6.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-02-06 17:23:41,103 INFO L158 Benchmark]: Witness Printer took 105.91ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 97.0MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:23:41,104 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.42ms. Allocated memory is still 192.9MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.37ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 46.4MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.71ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 43.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.17ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.02ms. Allocated memory is still 142.6MB. Free memory was 42.1MB in the beginning and 96.7MB in the end (delta: -54.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1612.01ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 103.2MB in the end (delta: -6.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 105.91ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 97.0MB in the end (delta: 6.2MB). There was no memory consumed. 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, 44 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, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 811 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 218 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 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-06 17:23:41,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE