./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_06_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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_add_06_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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'af63553f91a7385ddb1c36e24db8b73b3ffc0d3310e44bd61e2388ea54381920'] 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_add_06_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 af63553f91a7385ddb1c36e24db8b73b3ffc0d3310e44bd61e2388ea54381920 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:40:48,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:40:48,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 21:40:48,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:40:48,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:40:48,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:40:48,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:40:48,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:40:48,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:40:48,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:40:48,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:40:48,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:40:48,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:40:48,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:40:48,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:40:48,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:40:48,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:40:48,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:40:48,256 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 -> af63553f91a7385ddb1c36e24db8b73b3ffc0d3310e44bd61e2388ea54381920 [2024-11-07 21:40:48,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:40:48,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:40:48,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:40:48,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:40:48,501 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:40:48,502 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_add_06_bad.i [2024-11-07 21:40:49,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:40:49,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:40:49,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_06_bad.i [2024-11-07 21:40:49,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6546fbe4c/90920fe26ff84307b1ab612222090277/FLAGa42d04399 [2024-11-07 21:40:50,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6546fbe4c/90920fe26ff84307b1ab612222090277 [2024-11-07 21:40:50,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:40:50,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:40:50,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:40:50,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:40:50,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:40:50,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d10571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50, skipping insertion in model container [2024-11-07 21:40:50,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:40:50,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:40:50,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:40:50,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:40:50,770 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:40:50,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50 WrapperNode [2024-11-07 21:40:50,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:40:50,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:40:50,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:40:50,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:40:50,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,805 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-07 21:40:50,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:40:50,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:40:50,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:40:50,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:40:50,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,826 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]. [2024-11-07 21:40:50,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:40:50,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:40:50,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:40:50,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:40:50,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (1/1) ... [2024-11-07 21:40:50,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:40:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:40:50,861 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) [2024-11-07 21:40:50,866 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 [2024-11-07 21:40:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 21:40:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 21:40:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:40:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:40:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:40:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 21:40:50,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:40:50,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:40:51,064 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 21:40:51,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:40:51,073 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:40:51,073 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 21:40:51,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:51 BoogieIcfgContainer [2024-11-07 21:40:51,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:40:51,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:40:51,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:40:51,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:40:51,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:40:50" (1/3) ... [2024-11-07 21:40:51,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c79e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:40:51, skipping insertion in model container [2024-11-07 21:40:51,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:50" (2/3) ... [2024-11-07 21:40:51,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c79e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:40:51, skipping insertion in model container [2024-11-07 21:40:51,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:51" (3/3) ... [2024-11-07 21:40:51,099 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_06_bad.i [2024-11-07 21:40:51,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:40:51,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 21:40:51,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:40:51,162 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;@145f2e5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:40:51,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 21:40:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-07 21:40:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:40:51,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:51,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:51,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-07 21:40:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:40:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174360080] [2024-11-07 21:40:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:40:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:40:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:40:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:40:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174360080] [2024-11-07 21:40:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174360080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:40:51,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:40:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:40:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986332208] [2024-11-07 21:40:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:40:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 21:40:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:40:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 21:40:51,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:51,356 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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 3.0) internal successors, (9), 3 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) [2024-11-07 21:40:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:40:51,380 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-07 21:40:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 21:40:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2024-11-07 21:40:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:40:51,385 INFO L225 Difference]: With dead ends: 41 [2024-11-07 21:40:51,385 INFO L226 Difference]: Without dead ends: 18 [2024-11-07 21:40:51,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:51,390 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:40:51,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:40:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-07 21:40:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-07 21:40:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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) [2024-11-07 21:40:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-07 21:40:51,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-07 21:40:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:40:51,415 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-07 21:40:51,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2024-11-07 21:40:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-07 21:40:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 21:40:51,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:51,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:51,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 21:40:51,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1014034784, now seen corresponding path program 1 times [2024-11-07 21:40:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:40:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405173543] [2024-11-07 21:40:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:40:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:40:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:40:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:40:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405173543] [2024-11-07 21:40:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405173543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:40:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:40:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 21:40:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412498050] [2024-11-07 21:40:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:40:51,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 21:40:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:40:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 21:40:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:51,542 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-07 21:40:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:40:51,552 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-07 21:40:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 21:40:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-07 21:40:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:40:51,553 INFO L225 Difference]: With dead ends: 18 [2024-11-07 21:40:51,553 INFO L226 Difference]: Without dead ends: 17 [2024-11-07 21:40:51,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:51,554 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:40:51,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:40:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-07 21:40:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-07 21:40:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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) [2024-11-07 21:40:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-07 21:40:51,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-11-07 21:40:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:40:51,559 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-07 21:40:51,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-07 21:40:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-07 21:40:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 21:40:51,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:51,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 21:40:51,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-07 21:40:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:40:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305913421] [2024-11-07 21:40:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:40:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:40:51,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 21:40:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:40:51,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 21:40:51,616 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 21:40:51,617 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-07 21:40:51,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-07 21:40:51,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 21:40:51,620 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 21:40:51,635 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:40:51,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:40:51 BoogieIcfgContainer [2024-11-07 21:40:51,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:40:51,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:40:51,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:40:51,640 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:40:51,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:51" (3/4) ... [2024-11-07 21:40:51,641 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 21:40:51,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:40:51,643 INFO L158 Benchmark]: Toolchain (without parser) took 1482.13ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 33.0MB in the end (delta: 40.5MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-11-07 21:40:51,643 INFO L158 Benchmark]: CDTParser took 1.39ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.27ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 47.5MB in the end (delta: 25.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.98ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: Boogie Preprocessor took 27.78ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: RCFGBuilder took 239.86ms. Allocated memory is still 100.7MB. Free memory was 43.3MB in the beginning and 31.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: TraceAbstraction took 564.10ms. Allocated memory is still 100.7MB. Free memory was 30.7MB in the beginning and 33.0MB in the end (delta: -2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:51,644 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 100.7MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:51,645 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.39ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.27ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 47.5MB in the end (delta: 25.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.98ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.78ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 239.86ms. Allocated memory is still 100.7MB. Free memory was 43.3MB in the beginning and 31.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 564.10ms. Allocated memory is still 100.7MB. Free memory was 30.7MB in the beginning and 33.0MB in the end (delta: -2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 100.7MB. Free memory is still 33.0MB. 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 large string literal at line 1578, 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); [L1548] static const int STATIC_CONST_FIVE = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_fgets_add_06_bad() [L1551] int data; [L1552] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1553] COND TRUE STATIC_CONST_FIVE==5 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE STATIC_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1570]: 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 43 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 21:40:51,662 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 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_add_06_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 af63553f91a7385ddb1c36e24db8b73b3ffc0d3310e44bd61e2388ea54381920 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:40:53,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:40:53,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 21:40:53,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:40:53,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:40:53,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 21:40:53,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:40:53,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:40:53,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:40:53,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:40:53,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:40:53,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:40:53,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:40:53,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:40:53,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:40:53,443 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:40:53,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:40:53,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:40:53,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:40:53,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:40:53,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:40:53,445 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 -> af63553f91a7385ddb1c36e24db8b73b3ffc0d3310e44bd61e2388ea54381920 [2024-11-07 21:40:53,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:40:53,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:40:53,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:40:53,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:40:53,650 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:40:53,652 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_add_06_bad.i [2024-11-07 21:40:54,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:40:55,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:40:55,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_06_bad.i [2024-11-07 21:40:55,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0a1b8775/cb4b20ca473440c2a791f49974517cd4/FLAGea96f671f [2024-11-07 21:40:55,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0a1b8775/cb4b20ca473440c2a791f49974517cd4 [2024-11-07 21:40:55,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:40:55,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:40:55,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:40:55,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:40:55,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:40:55,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:40:55" (1/1) ... [2024-11-07 21:40:55,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658295a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:55, skipping insertion in model container [2024-11-07 21:40:55,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:40:55" (1/1) ... [2024-11-07 21:40:55,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:40:55,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:40:55,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:40:55,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:40:56,083 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:40:56,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56 WrapperNode [2024-11-07 21:40:56,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:40:56,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:40:56,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:40:56,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:40:56,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,130 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-11-07 21:40:56,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:40:56,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:40:56,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:40:56,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:40:56,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,151 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]. [2024-11-07 21:40:56,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:40:56,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:40:56,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:40:56,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:40:56,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (1/1) ... [2024-11-07 21:40:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:40:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:40:56,180 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) [2024-11-07 21:40:56,181 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 [2024-11-07 21:40:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 21:40:56,195 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 21:40:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 21:40:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:40:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:40:56,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:40:56,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:40:56,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:40:56,395 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-07 21:40:56,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:40:56,401 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:40:56,401 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 21:40:56,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:56 BoogieIcfgContainer [2024-11-07 21:40:56,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:40:56,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:40:56,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:40:56,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:40:56,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:40:55" (1/3) ... [2024-11-07 21:40:56,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b748cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:40:56, skipping insertion in model container [2024-11-07 21:40:56,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:40:56" (2/3) ... [2024-11-07 21:40:56,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b748cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:40:56, skipping insertion in model container [2024-11-07 21:40:56,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:56" (3/3) ... [2024-11-07 21:40:56,409 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_06_bad.i [2024-11-07 21:40:56,417 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:40:56,418 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 21:40:56,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:40:56,458 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;@42e098a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:40:56,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 21:40:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-07 21:40:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:40:56,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:56,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:56,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:56,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-07 21:40:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:40:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517122050] [2024-11-07 21:40:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:40:56,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 21:40:56,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 21:40:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:56,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 21:40:56,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:40:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:40:56,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:40:56,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 21:40:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517122050] [2024-11-07 21:40:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517122050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:40:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:40:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 21:40:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343417508] [2024-11-07 21:40:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:40:56,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 21:40:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 21:40:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 21:40:56,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 21:40:56,610 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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 9.0) internal successors, (9), 2 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) [2024-11-07 21:40:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:40:56,618 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-07 21:40:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 21:40:56,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 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 [2024-11-07 21:40:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:40:56,625 INFO L225 Difference]: With dead ends: 25 [2024-11-07 21:40:56,625 INFO L226 Difference]: Without dead ends: 17 [2024-11-07 21:40:56,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 21:40:56,628 INFO L432 NwaCegarLoop]: 29 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, 29 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 [2024-11-07 21:40:56,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:40:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-07 21:40:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-07 21:40:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-11-07 21:40:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-07 21:40:56,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-11-07 21:40:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:40:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-07 21:40:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 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) [2024-11-07 21:40:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-07 21:40:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 21:40:56,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:56,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:56,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 21:40:56,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:56,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:56,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -586560645, now seen corresponding path program 1 times [2024-11-07 21:40:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:40:56,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032344151] [2024-11-07 21:40:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:40:56,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 21:40:56,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 21:40:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:40:56,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 21:40:56,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:40:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:40:56,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:40:56,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 21:40:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032344151] [2024-11-07 21:40:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032344151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:40:56,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:40:56,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 21:40:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367763779] [2024-11-07 21:40:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:40:56,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 21:40:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 21:40:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 21:40:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:56,941 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2024-11-07 21:40:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:40:56,950 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-07 21:40:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 21:40:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 [2024-11-07 21:40:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:40:56,951 INFO L225 Difference]: With dead ends: 21 [2024-11-07 21:40:56,951 INFO L226 Difference]: Without dead ends: 17 [2024-11-07 21:40:56,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:40:56,952 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:40:56,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:40:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-07 21:40:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-07 21:40:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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) [2024-11-07 21:40:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-07 21:40:56,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2024-11-07 21:40:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:40:56,956 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-07 21:40:56,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2024-11-07 21:40:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-07 21:40:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 21:40:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:40:56,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:40:56,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 21:40:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:57,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 21:40:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:40:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-07 21:40:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:40:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263943468] [2024-11-07 21:40:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:40:57,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:40:57,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 21:40:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 21:40:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:40:57,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 21:40:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:40:57,267 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 21:40:57,267 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 21:40:57,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-07 21:40:57,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-07 21:40:57,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 21:40:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 21:40:57,476 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 21:40:57,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:40:57,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:40:57 BoogieIcfgContainer [2024-11-07 21:40:57,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:40:57,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:40:57,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:40:57,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:40:57,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:40:56" (3/4) ... [2024-11-07 21:40:57,495 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 21:40:57,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:40:57,496 INFO L158 Benchmark]: Toolchain (without parser) took 2164.17ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.9MB in the end (delta: 26.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-07 21:40:57,496 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 105.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:57,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.92ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.7MB in the end (delta: 12.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-11-07 21:40:57,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:57,497 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:57,497 INFO L158 Benchmark]: RCFGBuilder took 240.85ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 60.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 21:40:57,497 INFO L158 Benchmark]: TraceAbstraction took 1089.49ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 64.9MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:57,498 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:40:57,498 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 105.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.92ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.7MB in the end (delta: 12.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.85ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 60.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1089.49ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 64.9MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 29.6kB). 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 large string literal at line 1578, 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); [L1548] static const int STATIC_CONST_FIVE = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_fgets_add_06_bad() [L1551] int data; [L1552] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1553] COND TRUE STATIC_CONST_FIVE==5 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE STATIC_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FIVE=5, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1570]: 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 21:40:57,516 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