./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_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/CWE191_Integer_Underflow__int_fgets_postdec_12_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', '1456520146b55fc1e958217ef7509552426c75ec92eb783b51ac67cf97945b6b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_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 1456520146b55fc1e958217ef7509552426c75ec92eb783b51ac67cf97945b6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:40:54,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:40:54,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 22:40:54,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:40:54,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:40:54,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:40:54,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:40:54,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:40:54,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:40:54,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:40:54,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:40:54,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:40:54,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:40:54,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:40:54,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:40:54,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:40:54,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:40:54,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:40:54,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:40:54,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:40:54,458 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 -> 1456520146b55fc1e958217ef7509552426c75ec92eb783b51ac67cf97945b6b [2024-11-07 22:40:54,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:40:54,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:40:54,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:40:54,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:40:54,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:40:54,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:40:55,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:40:56,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:40:56,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:40:56,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf43cab7a/334310a96b4c4f22bd18b9b9b75b46d0/FLAGe9d3cd2ed [2024-11-07 22:40:56,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf43cab7a/334310a96b4c4f22bd18b9b9b75b46d0 [2024-11-07 22:40:56,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:40:56,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:40:56,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:40:56,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:40:56,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:40:56,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:56" (1/1) ... [2024-11-07 22:40:56,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf8f04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:56, skipping insertion in model container [2024-11-07 22:40:56,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:56" (1/1) ... [2024-11-07 22:40:56,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:40:57,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:40:57,153 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:40:57,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:40:57,375 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:40:57,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57 WrapperNode [2024-11-07 22:40:57,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:40:57,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:40:57,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:40:57,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:40:57,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,434 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-07 22:40:57,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:40:57,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:40:57,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:40:57,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:40:57,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,473 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 22:40:57,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:40:57,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:40:57,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:40:57,494 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:40:57,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (1/1) ... [2024-11-07 22:40:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:40:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:40:57,529 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 22:40:57,532 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 22:40:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-07 22:40:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-07 22:40:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-07 22:40:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-07 22:40:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:40:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:40:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:40:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:40:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:40:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 22:40:57,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:40:57,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:40:57,846 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 22:40:57,847 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:40:57,858 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:40:57,859 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 22:40:57,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:57 BoogieIcfgContainer [2024-11-07 22:40:57,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:40:57,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:40:57,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:40:57,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:40:57,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:40:56" (1/3) ... [2024-11-07 22:40:57,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1aa233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:57, skipping insertion in model container [2024-11-07 22:40:57,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:57" (2/3) ... [2024-11-07 22:40:57,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1aa233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:57, skipping insertion in model container [2024-11-07 22:40:57,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:57" (3/3) ... [2024-11-07 22:40:57,869 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:40:57,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:40:57,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 22:40:57,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:40:57,953 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;@bf6ea85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:40:57,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 22:40:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 22:40:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 22:40:57,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:40:57,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:40:57,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:40:57,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:40:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -786218938, now seen corresponding path program 1 times [2024-11-07 22:40:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:40:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809360990] [2024-11-07 22:40:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:40:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:40:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:40:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:40:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:40:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:40:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:40:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809360990] [2024-11-07 22:40:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809360990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:40:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:40:58,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:40:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704616642] [2024-11-07 22:40:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:40:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:40:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:40:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:40:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,408 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:40:58,465 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-07 22:40:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:40:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-07 22:40:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:40:58,474 INFO L225 Difference]: With dead ends: 65 [2024-11-07 22:40:58,474 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 22:40:58,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,479 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:40:58,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:40:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 22:40:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-07 22:40:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 22:40:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-07 22:40:58,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2024-11-07 22:40:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:40:58,522 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-07 22:40:58,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-07 22:40:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 22:40:58,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:40:58,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:40:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 22:40:58,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:40:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:40:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1397016770, now seen corresponding path program 1 times [2024-11-07 22:40:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:40:58,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996884611] [2024-11-07 22:40:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:40:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:40:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:40:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:40:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:40:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:40:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:40:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996884611] [2024-11-07 22:40:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996884611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:40:58,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:40:58,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:40:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555352106] [2024-11-07 22:40:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:40:58,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:40:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:40:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:40:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,706 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:40:58,730 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-07 22:40:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:40:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-07 22:40:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:40:58,732 INFO L225 Difference]: With dead ends: 42 [2024-11-07 22:40:58,732 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 22:40:58,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,733 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:40:58,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:40:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 22:40:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-07 22:40:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 22:40:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-07 22:40:58,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2024-11-07 22:40:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:40:58,744 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-07 22:40:58,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-07 22:40:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 22:40:58,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:40:58,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:40:58,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 22:40:58,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:40:58,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:40:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1397024746, now seen corresponding path program 1 times [2024-11-07 22:40:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:40:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605291135] [2024-11-07 22:40:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:40:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:40:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:40:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:40:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:40:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:40:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:40:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605291135] [2024-11-07 22:40:58,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605291135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:40:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:40:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:40:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57909568] [2024-11-07 22:40:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:40:58,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:40:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:40:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:40:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,861 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:40:58,893 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-07 22:40:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:40:58,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-07 22:40:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:40:58,894 INFO L225 Difference]: With dead ends: 42 [2024-11-07 22:40:58,894 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 22:40:58,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:58,897 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:40:58,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:40:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 22:40:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-07 22:40:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 22:40:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-07 22:40:58,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 22 [2024-11-07 22:40:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:40:58,902 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-07 22:40:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-07 22:40:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 22:40:58,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:40:58,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:40:58,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 22:40:58,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:40:58,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:40:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash 358094249, now seen corresponding path program 1 times [2024-11-07 22:40:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:40:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639424363] [2024-11-07 22:40:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:40:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:40:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:40:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:40:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:40:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:40:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:40:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:40:59,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639424363] [2024-11-07 22:40:59,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639424363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:40:59,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:40:59,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:40:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175380736] [2024-11-07 22:40:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:40:59,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:40:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:40:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:40:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:59,010 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:40:59,039 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-07 22:40:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:40:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-07 22:40:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:40:59,040 INFO L225 Difference]: With dead ends: 44 [2024-11-07 22:40:59,041 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 22:40:59,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:40:59,042 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:40:59,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:40:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 22:40:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 22:40:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 22:40:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-07 22:40:59,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2024-11-07 22:40:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:40:59,050 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-07 22:40:59,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:40:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-07 22:40:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 22:40:59,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:40:59,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:40:59,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 22:40:59,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:40:59,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:40:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -369234517, now seen corresponding path program 1 times [2024-11-07 22:40:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:40:59,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630332906] [2024-11-07 22:40:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:40:59,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:40:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:40:59,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:40:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:40:59,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 22:40:59,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:40:59,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 22:40:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 22:40:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 22:40:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 22:40:59,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 22:40:59,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 22:40:59,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:40:59,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:40:59 BoogieIcfgContainer [2024-11-07 22:40:59,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:40:59,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:40:59,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:40:59,186 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:40:59,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:57" (3/4) ... [2024-11-07 22:40:59,190 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:40:59,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:40:59,191 INFO L158 Benchmark]: Toolchain (without parser) took 2803.02ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 89.2MB in the beginning and 127.2MB in the end (delta: -38.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-07 22:40:59,192 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:40:59,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.33ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 70.9MB in the end (delta: 18.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2024-11-07 22:40:59,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:40:59,193 INFO L158 Benchmark]: Boogie Preprocessor took 56.12ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 66.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:40:59,193 INFO L158 Benchmark]: RCFGBuilder took 365.63ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 52.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 22:40:59,193 INFO L158 Benchmark]: TraceAbstraction took 1324.44ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 51.9MB in the beginning and 127.3MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:40:59,193 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:40:59,195 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.35ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 987.33ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 70.9MB in the end (delta: 18.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.12ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 66.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.63ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 52.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1324.44ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 51.9MB in the beginning and 127.3MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 22.5kB). 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE191_Integer_Underflow__int_fgets_postdec_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: 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 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 156 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 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 22:40:59,224 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/CWE191_Integer_Underflow__int_fgets_postdec_12_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 1456520146b55fc1e958217ef7509552426c75ec92eb783b51ac67cf97945b6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:41:01,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:41:01,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 22:41:01,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:41:01,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:41:01,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 22:41:01,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:41:01,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:41:01,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:41:01,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:41:01,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:41:01,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:41:01,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:41:01,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:41:01,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:41:01,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:41:01,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:41:01,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:41:01,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:41:01,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:41:01,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:41:01,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:41:01,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:41:01,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:41:01,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:41:01,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:41:01,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:41:01,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:41:01,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:41:01,484 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 -> 1456520146b55fc1e958217ef7509552426c75ec92eb783b51ac67cf97945b6b [2024-11-07 22:41:01,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:41:01,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:41:01,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:41:01,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:41:01,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:41:01,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:41:03,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:41:03,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:41:03,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:41:03,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3599eb6b/b7fff9f17e244ed5b9f5cca347f300f2/FLAG900d3eb70 [2024-11-07 22:41:03,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3599eb6b/b7fff9f17e244ed5b9f5cca347f300f2 [2024-11-07 22:41:03,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:41:03,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:41:03,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:41:03,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:41:03,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:41:03,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:41:03" (1/1) ... [2024-11-07 22:41:03,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3616db5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:03, skipping insertion in model container [2024-11-07 22:41:03,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:41:03" (1/1) ... [2024-11-07 22:41:03,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:41:04,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:41:04,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:41:04,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:41:04,416 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:41:04,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04 WrapperNode [2024-11-07 22:41:04,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:41:04,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:41:04,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:41:04,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:41:04,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,478 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-11-07 22:41:04,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:41:04,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:41:04,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:41:04,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:41:04,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,520 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 22:41:04,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:41:04,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:41:04,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:41:04,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:41:04,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (1/1) ... [2024-11-07 22:41:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:41:04,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:41:04,579 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 22:41:04,581 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 22:41:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-07 22:41:04,600 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-07 22:41:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-07 22:41:04,601 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-07 22:41:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:41:04,601 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:41:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 22:41:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:41:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:41:04,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:41:04,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:41:04,725 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:41:04,896 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 22:41:04,896 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:41:04,906 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:41:04,908 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 22:41:04,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:41:04 BoogieIcfgContainer [2024-11-07 22:41:04,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:41:04,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:41:04,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:41:04,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:41:04,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:41:03" (1/3) ... [2024-11-07 22:41:04,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2198e777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:41:04, skipping insertion in model container [2024-11-07 22:41:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:41:04" (2/3) ... [2024-11-07 22:41:04,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2198e777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:41:04, skipping insertion in model container [2024-11-07 22:41:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:41:04" (3/3) ... [2024-11-07 22:41:04,919 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_12_bad.i [2024-11-07 22:41:04,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:41:04,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 22:41:04,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:41:04,971 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;@3ff1c501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:41:04,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 22:41:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 22:41:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 22:41:04,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:41:04,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:41:04,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:41:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:41:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1142699916, now seen corresponding path program 1 times [2024-11-07 22:41:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:41:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841152983] [2024-11-07 22:41:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:41:04,994 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 22:41:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:41:04,997 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 22:41:04,998 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 22:41:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:41:05,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:41:05,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:41:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:41:05,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:41:05,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:41:05,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841152983] [2024-11-07 22:41:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841152983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:41:05,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:41:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:41:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129107055] [2024-11-07 22:41:05,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:41:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:41:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:41:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:41:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:41:05,252 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:41:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:41:05,311 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-07 22:41:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:41:05,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-07 22:41:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:41:05,319 INFO L225 Difference]: With dead ends: 61 [2024-11-07 22:41:05,319 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 22:41:05,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:41:05,327 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:41:05,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:41:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 22:41:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-07 22:41:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 22:41:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-07 22:41:05,365 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2024-11-07 22:41:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:41:05,367 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-07 22:41:05,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:41:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-07 22:41:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 22:41:05,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:41:05,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:41:05,375 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 (2)] Ended with exit code 0 [2024-11-07 22:41:05,570 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 22:41:05,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:41:05,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:41:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1063967074, now seen corresponding path program 1 times [2024-11-07 22:41:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:41:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826629400] [2024-11-07 22:41:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:41:05,572 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 22:41:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:41:05,575 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 22:41:05,576 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 22:41:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:41:05,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:41:05,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:41:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:41:05,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:41:05,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:41:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826629400] [2024-11-07 22:41:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826629400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:41:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:41:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:41:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55936650] [2024-11-07 22:41:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:41:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:41:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:41:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:41:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:41:05,689 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:41:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:41:05,707 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-07 22:41:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:41:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-07 22:41:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:41:05,709 INFO L225 Difference]: With dead ends: 29 [2024-11-07 22:41:05,709 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 22:41:05,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:41:05,710 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:41:05,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:41:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 22:41:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 22:41:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 22:41:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-07 22:41:05,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 20 [2024-11-07 22:41:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:41:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-07 22:41:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:41:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-07 22:41:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 22:41:05,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:41:05,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:41:05,720 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 22:41:05,920 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 22:41:05,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:41:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:41:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1847522777, now seen corresponding path program 1 times [2024-11-07 22:41:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:41:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640800024] [2024-11-07 22:41:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:41:05,922 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 22:41:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:41:05,923 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 22:41:05,925 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 22:41:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:41:06,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:41:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:41:06,080 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 22:41:06,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:41:06,080 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 22:41:06,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 22:41:06,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 22:41:06,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 22:41:06,085 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 22:41:06,282 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 22:41:06,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 22:41:06,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:41:06,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:41:06 BoogieIcfgContainer [2024-11-07 22:41:06,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:41:06,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:41:06,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:41:06,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:41:06,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:41:04" (3/4) ... [2024-11-07 22:41:06,314 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:41:06,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:41:06,316 INFO L158 Benchmark]: Toolchain (without parser) took 2801.76ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 89.0MB in the beginning and 177.6MB in the end (delta: -88.6MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-07 22:41:06,316 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 117.4MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:41:06,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 901.20ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 66.4MB in the end (delta: 22.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2024-11-07 22:41:06,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.53ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:41:06,317 INFO L158 Benchmark]: Boogie Preprocessor took 70.45ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:41:06,317 INFO L158 Benchmark]: RCFGBuilder took 356.80ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 45.7MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:41:06,317 INFO L158 Benchmark]: TraceAbstraction took 1399.01ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 45.2MB in the beginning and 178.3MB in the end (delta: -133.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:41:06,318 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 243.3MB. Free memory was 178.3MB in the beginning and 177.6MB in the end (delta: 674.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:41:06,319 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 117.4MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 901.20ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 66.4MB in the end (delta: 22.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.53ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.45ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 356.80ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 45.7MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1399.01ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 45.2MB in the beginning and 178.3MB in the end (delta: -133.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 243.3MB. Free memory was 178.3MB in the beginning and 177.6MB in the end (delta: 674.7kB). 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE191_Integer_Underflow__int_fgets_postdec_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: 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 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 82 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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 22:41:06,343 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