./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 11:11:51,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 11:11:51,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 11:11:51,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 11:11:51,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 11:11:51,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 11:11:51,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 11:11:51,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 11:11:51,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 11:11:51,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 11:11:51,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 11:11:51,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 11:11:51,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 11:11:51,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 11:11:51,911 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 11:11:51,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 11:11:51,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:11:51,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 11:11:51,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 11:11:51,914 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2025-02-08 11:11:52,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 11:11:52,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 11:11:52,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 11:11:52,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 11:11:52,167 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 11:11:52,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:11:53,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1fa1f45/28ef50df3d584ee6b27ff94ead960f2a/FLAG326c15652 [2025-02-08 11:11:53,714 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 11:11:53,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:11:53,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1fa1f45/28ef50df3d584ee6b27ff94ead960f2a/FLAG326c15652 [2025-02-08 11:11:53,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1fa1f45/28ef50df3d584ee6b27ff94ead960f2a [2025-02-08 11:11:53,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 11:11:53,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 11:11:53,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 11:11:53,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 11:11:53,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 11:11:53,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:11:53" (1/1) ... [2025-02-08 11:11:53,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b49333d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:53, skipping insertion in model container [2025-02-08 11:11:53,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:11:53" (1/1) ... [2025-02-08 11:11:53,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 11:11:54,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:11:54,338 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 11:11:54,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:11:54,495 INFO L204 MainTranslator]: Completed translation [2025-02-08 11:11:54,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54 WrapperNode [2025-02-08 11:11:54,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 11:11:54,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 11:11:54,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 11:11:54,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 11:11:54,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,535 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-02-08 11:11:54,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 11:11:54,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 11:11:54,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 11:11:54,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 11:11:54,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,555 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-02-08 11:11:54,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 11:11:54,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 11:11:54,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 11:11:54,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 11:11:54,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (1/1) ... [2025-02-08 11:11:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:11:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:11:54,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 11:11:54,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 11:11:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 11:11:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 11:11:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 11:11:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 11:11:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 11:11:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 11:11:54,702 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 11:11:54,703 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 11:11:54,787 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-08 11:11:54,787 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 11:11:54,792 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 11:11:54,793 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 11:11:54,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:11:54 BoogieIcfgContainer [2025-02-08 11:11:54,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 11:11:54,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 11:11:54,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 11:11:54,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 11:11:54,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:11:53" (1/3) ... [2025-02-08 11:11:54,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b08f20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:11:54, skipping insertion in model container [2025-02-08 11:11:54,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:54" (2/3) ... [2025-02-08 11:11:54,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b08f20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:11:54, skipping insertion in model container [2025-02-08 11:11:54,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:11:54" (3/3) ... [2025-02-08 11:11:54,799 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:11:54,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 11:11:54,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 11:11:54,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 11:11:54,845 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;@59571b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 11:11:54,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 11:11:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 11:11:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 11:11:54,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:11:54,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:11:54,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:11:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:11:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -723650022, now seen corresponding path program 1 times [2025-02-08 11:11:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:11:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031328375] [2025-02-08 11:11:54,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:11:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:11:54,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 11:11:54,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 11:11:54,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:11:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:11:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:11:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:11:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031328375] [2025-02-08 11:11:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031328375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:11:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:11:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 11:11:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557614732] [2025-02-08 11:11:55,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:11:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:11:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:11:55,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:11:55,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:11:55,046 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:11:55,078 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-08 11:11:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:11:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-08 11:11:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:11:55,084 INFO L225 Difference]: With dead ends: 49 [2025-02-08 11:11:55,084 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 11:11:55,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:11:55,089 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:11:55,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:11:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 11:11:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-02-08 11:11:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 11:11:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-08 11:11:55,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2025-02-08 11:11:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:11:55,140 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-08 11:11:55,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-08 11:11:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 11:11:55,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:11:55,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:11:55,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 11:11:55,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:11:55,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:11:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -958039119, now seen corresponding path program 1 times [2025-02-08 11:11:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:11:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443286086] [2025-02-08 11:11:55,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:11:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:11:55,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 11:11:55,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 11:11:55,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:11:55,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:11:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:11:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:11:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443286086] [2025-02-08 11:11:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443286086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:11:55,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:11:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 11:11:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344282673] [2025-02-08 11:11:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:11:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 11:11:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:11:55,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 11:11:55,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:11:55,241 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:11:55,263 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-02-08 11:11:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 11:11:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 11:11:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:11:55,264 INFO L225 Difference]: With dead ends: 32 [2025-02-08 11:11:55,264 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 11:11:55,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:11:55,264 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:11:55,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:11:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 11:11:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 11:11:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 11:11:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-08 11:11:55,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 11 [2025-02-08 11:11:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:11:55,268 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 11:11:55,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-08 11:11:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 11:11:55,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:11:55,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:11:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 11:11:55,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:11:55,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:11:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1687675922, now seen corresponding path program 1 times [2025-02-08 11:11:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:11:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683061815] [2025-02-08 11:11:55,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:11:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:11:55,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 11:11:55,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 11:11:55,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:11:55,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:11:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:11:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:11:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683061815] [2025-02-08 11:11:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683061815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:11:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:11:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 11:11:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001021497] [2025-02-08 11:11:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:11:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 11:11:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:11:55,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 11:11:55,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:11:55,358 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:11:55,372 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-02-08 11:11:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 11:11:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 11:11:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:11:55,373 INFO L225 Difference]: With dead ends: 30 [2025-02-08 11:11:55,373 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 11:11:55,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:11:55,374 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:11:55,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:11:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 11:11:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 11:11:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 11:11:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-02-08 11:11:55,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 15 [2025-02-08 11:11:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:11:55,378 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-08 11:11:55,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:11:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-02-08 11:11:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 11:11:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:11:55,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:11:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 11:11:55,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:11:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:11:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -778346049, now seen corresponding path program 1 times [2025-02-08 11:11:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:11:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440929110] [2025-02-08 11:11:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:11:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:11:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 11:11:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 11:11:55,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:11:55,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 11:11:55,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 11:11:55,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 11:11:55,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 11:11:55,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:11:55,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 11:11:55,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 11:11:55,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 11:11:55,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 11:11:55,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 11:11:55,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 11:11:55,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 11:11:55,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 11:11:55,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 11:11:55,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 11:11:55,419 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 11:11:55,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 11:11:55,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:11:55 BoogieIcfgContainer [2025-02-08 11:11:55,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 11:11:55,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 11:11:55,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 11:11:55,455 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 11:11:55,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:11:54" (3/4) ... [2025-02-08 11:11:55,457 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 11:11:55,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 11:11:55,458 INFO L158 Benchmark]: Toolchain (without parser) took 1694.13ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 105.1MB in the end (delta: -4.0MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2025-02-08 11:11:55,458 INFO L158 Benchmark]: CDTParser took 2.73ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:11:55,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.66ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 40.9MB in the end (delta: 59.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 11:11:55,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 37.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:11:55,459 INFO L158 Benchmark]: Boogie Preprocessor took 28.06ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.9MB in the end (delta: 990.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:11:55,459 INFO L158 Benchmark]: IcfgBuilder took 229.15ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 91.9MB in the end (delta: -55.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-02-08 11:11:55,459 INFO L158 Benchmark]: TraceAbstraction took 659.00ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 105.2MB in the end (delta: -14.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2025-02-08 11:11:55,459 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 57.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:11:55,460 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.73ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.66ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 40.9MB in the end (delta: 59.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 37.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.06ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.9MB in the end (delta: 990.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 229.15ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 91.9MB in the end (delta: -55.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 659.00ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 105.2MB in the end (delta: -14.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 57.0kB). 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 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 80 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 11:11:55,472 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 11:11:57,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 11:11:57,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-02-08 11:11:57,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 11:11:57,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 11:11:57,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-02-08 11:11:57,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 11:11:57,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 11:11:57,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 11:11:57,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 11:11:57,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 11:11:57,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 11:11:57,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 11:11:57,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 11:11:57,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 11:11:57,449 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 11:11:57,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 11:11:57,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 11:11:57,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 11:11:57,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 11:11:57,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:11:57,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 11:11:57,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 11:11:57,453 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2025-02-08 11:11:57,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 11:11:57,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 11:11:57,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 11:11:57,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 11:11:57,701 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 11:11:57,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:11:58,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/208fa33df/f0a17f1027a1430d9a15486eb38aa021/FLAG0cc791e15 [2025-02-08 11:11:59,292 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 11:11:59,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:11:59,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/208fa33df/f0a17f1027a1430d9a15486eb38aa021/FLAG0cc791e15 [2025-02-08 11:11:59,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/208fa33df/f0a17f1027a1430d9a15486eb38aa021 [2025-02-08 11:11:59,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 11:11:59,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 11:11:59,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 11:11:59,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 11:11:59,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 11:11:59,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:11:59" (1/1) ... [2025-02-08 11:11:59,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faa9ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:11:59, skipping insertion in model container [2025-02-08 11:11:59,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:11:59" (1/1) ... [2025-02-08 11:11:59,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 11:12:00,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:12:00,083 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 11:12:00,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:12:00,302 INFO L204 MainTranslator]: Completed translation [2025-02-08 11:12:00,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00 WrapperNode [2025-02-08 11:12:00,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 11:12:00,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 11:12:00,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 11:12:00,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 11:12:00,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,342 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-02-08 11:12:00,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 11:12:00,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 11:12:00,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 11:12:00,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 11:12:00,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,362 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-02-08 11:12:00,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 11:12:00,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 11:12:00,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 11:12:00,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 11:12:00,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (1/1) ... [2025-02-08 11:12:00,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:12:00,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:00,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 11:12:00,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 11:12:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 11:12:00,430 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 11:12:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 11:12:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 11:12:00,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 11:12:00,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 11:12:00,546 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 11:12:00,548 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 11:12:00,667 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-08 11:12:00,669 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 11:12:00,675 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 11:12:00,676 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 11:12:00,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:00 BoogieIcfgContainer [2025-02-08 11:12:00,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 11:12:00,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 11:12:00,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 11:12:00,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 11:12:00,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:11:59" (1/3) ... [2025-02-08 11:12:00,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ab753b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:12:00, skipping insertion in model container [2025-02-08 11:12:00,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:12:00" (2/3) ... [2025-02-08 11:12:00,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ab753b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:12:00, skipping insertion in model container [2025-02-08 11:12:00,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:00" (3/3) ... [2025-02-08 11:12:00,684 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2025-02-08 11:12:00,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 11:12:00,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 11:12:00,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 11:12:00,745 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;@2f6cc8fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 11:12:00,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 11:12:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 11:12:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 11:12:00,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:00,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:00,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:12:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -723650022, now seen corresponding path program 1 times [2025-02-08 11:12:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 11:12:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791423641] [2025-02-08 11:12:00,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:00,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:00,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:00,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 11:12:00,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 11:12:00,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 11:12:00,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 11:12:00,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:00,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 11:12:00,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:12:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:12:00,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:12:00,860 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 11:12:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791423641] [2025-02-08 11:12:00,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791423641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:00,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 11:12:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929021199] [2025-02-08 11:12:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 11:12:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 11:12:00,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 11:12:00,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 11:12:00,876 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:00,884 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-02-08 11:12:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 11:12:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-08 11:12:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:00,888 INFO L225 Difference]: With dead ends: 28 [2025-02-08 11:12:00,889 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 11:12:00,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 11:12:00,892 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:12:00,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 11:12:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 11:12:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 11:12:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-08 11:12:00,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2025-02-08 11:12:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-08 11:12:00,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-08 11:12:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 11:12:00,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:00,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:00,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 11:12:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:12:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -958314221, now seen corresponding path program 1 times [2025-02-08 11:12:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 11:12:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759666633] [2025-02-08 11:12:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:01,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:01,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 11:12:01,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 11:12:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 11:12:01,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 11:12:01,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:01,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:01,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 11:12:01,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:12:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:12:01,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:12:01,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 11:12:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759666633] [2025-02-08 11:12:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759666633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:01,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:01,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 11:12:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653157386] [2025-02-08 11:12:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 11:12:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 11:12:01,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 11:12:01,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:12:01,287 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:01,303 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-02-08 11:12:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 11:12:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 11:12:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:01,304 INFO L225 Difference]: With dead ends: 32 [2025-02-08 11:12:01,304 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 11:12:01,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:12:01,305 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:12:01,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 11:12:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-02-08 11:12:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 11:12:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-02-08 11:12:01,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 11 [2025-02-08 11:12:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:01,309 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-02-08 11:12:01,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-02-08 11:12:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 11:12:01,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:01,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:01,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 11:12:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:12:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 365558370, now seen corresponding path program 1 times [2025-02-08 11:12:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 11:12:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526329451] [2025-02-08 11:12:01,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:01,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:01,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 11:12:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 11:12:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 11:12:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 11:12:01,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:01,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:12:01,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 11:12:01,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:12:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 11:12:01,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:12:01,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 11:12:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526329451] [2025-02-08 11:12:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526329451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:12:01,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:12:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 11:12:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076526619] [2025-02-08 11:12:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:12:01,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 11:12:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 11:12:01,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 11:12:01,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:12:01,664 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:12:01,694 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2025-02-08 11:12:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 11:12:01,694 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 11:12:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:12:01,695 INFO L225 Difference]: With dead ends: 50 [2025-02-08 11:12:01,695 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 11:12:01,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 11:12:01,696 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:12:01,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:12:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 11:12:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 11:12:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 11:12:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-02-08 11:12:01,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 12 [2025-02-08 11:12:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:12:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-02-08 11:12:01,701 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 11:12:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-02-08 11:12:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 11:12:01,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:12:01,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:12:01,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 11:12:01,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 11:12:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:12:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash -778346049, now seen corresponding path program 1 times [2025-02-08 11:12:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 11:12:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022407444] [2025-02-08 11:12:01,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:12:01,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:01,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:12:01,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 11:12:01,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 11:12:01,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 11:12:02,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 11:12:02,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:02,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 11:12:02,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 11:12:02,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 11:12:02,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 11:12:02,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:12:02,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 11:12:02,069 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 11:12:02,069 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 11:12:02,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 11:12:02,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 11:12:02,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 11:12:02,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 11:12:02,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 11:12:02,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 11:12:02,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 11:12:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:12:02,279 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 11:12:02,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 11:12:02,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:12:02 BoogieIcfgContainer [2025-02-08 11:12:02,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 11:12:02,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 11:12:02,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 11:12:02,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 11:12:02,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:12:00" (3/4) ... [2025-02-08 11:12:02,312 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 11:12:02,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 11:12:02,313 INFO L158 Benchmark]: Toolchain (without parser) took 2785.36ms. Allocated memory is still 83.9MB. Free memory was 56.1MB in the beginning and 32.1MB in the end (delta: 24.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-02-08 11:12:02,313 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:12:02,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.77ms. Allocated memory is still 83.9MB. Free memory was 56.1MB in the beginning and 49.5MB in the end (delta: 6.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-02-08 11:12:02,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:12:02,314 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 44.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 11:12:02,315 INFO L158 Benchmark]: IcfgBuilder took 302.23ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 29.8MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 11:12:02,318 INFO L158 Benchmark]: TraceAbstraction took 1626.90ms. Allocated memory is still 83.9MB. Free memory was 29.1MB in the beginning and 32.1MB in the end (delta: -3.0MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2025-02-08 11:12:02,319 INFO L158 Benchmark]: Witness Printer took 7.50ms. Allocated memory is still 83.9MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:12:02,319 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.77ms. Allocated memory is still 83.9MB. Free memory was 56.1MB in the beginning and 49.5MB in the end (delta: 6.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 44.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 302.23ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 29.8MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1626.90ms. Allocated memory is still 83.9MB. Free memory was 29.1MB in the beginning and 32.1MB in the end (delta: -3.0MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Witness Printer took 7.50ms. Allocated memory is still 83.9MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 28.0kB). 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 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 79 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 11:12:02,341 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: UNKNOWN: Overapproximated counterexample