./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 734d50c80d6cf17c396db83d36fca602dbddd3c09ab595026555aa5c7a4c0a2e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:58:02,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:58:03,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 19:58:03,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:58:03,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:58:03,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:58:03,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:58:03,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:58:03,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:58:03,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:58:03,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:58:03,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:58:03,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:58:03,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:58:03,040 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:58:03,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:58:03,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:58:03,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:58:03,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:58:03,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:58:03,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:58:03,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:58:03,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:58:03,043 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:58:03,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:58:03,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:58:03,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:58:03,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:58:03,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:58:03,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:58:03,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:58:03,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:03,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:58:03,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:58:03,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:58:03,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:58:03,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:58:03,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:58:03,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:58:03,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:58:03,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:58:03,049 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 734d50c80d6cf17c396db83d36fca602dbddd3c09ab595026555aa5c7a4c0a2e [2024-11-20 19:58:03,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:58:03,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:58:03,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:58:03,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:58:03,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:58:03,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:04,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:58:04,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:58:04,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:04,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df05bc3b8/ad83a709c8b449ddb851e04034a20d61/FLAGb77fae5d2 [2024-11-20 19:58:04,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df05bc3b8/ad83a709c8b449ddb851e04034a20d61 [2024-11-20 19:58:04,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:58:04,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:58:04,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:04,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:58:04,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:58:04,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:04" (1/1) ... [2024-11-20 19:58:04,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db37aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:04, skipping insertion in model container [2024-11-20 19:58:04,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:04" (1/1) ... [2024-11-20 19:58:04,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:58:05,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:05,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:58:05,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:05,662 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:58:05,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05 WrapperNode [2024-11-20 19:58:05,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:05,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:05,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:58:05,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:58:05,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,722 INFO L138 Inliner]: procedures = 498, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-11-20 19:58:05,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:05,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:58:05,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:58:05,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:58:05,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,760 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-20 19:58:05,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:58:05,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:58:05,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:58:05,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:58:05,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (1/1) ... [2024-11-20 19:58:05,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:05,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 19:58:05,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 19:58:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 19:58:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 19:58:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-20 19:58:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-20 19:58:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:58:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:58:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:58:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:58:05,981 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:58:05,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:58:06,091 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 19:58:06,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:58:06,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:58:06,105 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:58:06,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:06 BoogieIcfgContainer [2024-11-20 19:58:06,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:58:06,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:58:06,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:58:06,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:58:06,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:58:04" (1/3) ... [2024-11-20 19:58:06,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599cf1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:06, skipping insertion in model container [2024-11-20 19:58:06,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:05" (2/3) ... [2024-11-20 19:58:06,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599cf1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:06, skipping insertion in model container [2024-11-20 19:58:06,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:06" (3/3) ... [2024-11-20 19:58:06,112 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:06,141 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:58:06,142 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:58:06,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:58:06,205 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;@43070a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:58:06,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:58:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 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-20 19:58:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 19:58:06,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:06,217 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-20 19:58:06,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash -830864152, now seen corresponding path program 1 times [2024-11-20 19:58:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307295310] [2024-11-20 19:58:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:58:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:58:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:58:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 19:58:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:58:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307295310] [2024-11-20 19:58:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307295310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:58:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987274470] [2024-11-20 19:58:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:06,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:58:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:06,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:58:06,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 19:58:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:06,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 19:58:06,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:06,754 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-20 19:58:06,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987274470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:58:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 19:58:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636351511] [2024-11-20 19:58:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:58:06,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:58:06,783 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 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) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-20 19:58:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:06,817 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-20 19:58:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:06,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-20 19:58:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:06,825 INFO L225 Difference]: With dead ends: 40 [2024-11-20 19:58:06,825 INFO L226 Difference]: Without dead ends: 31 [2024-11-20 19:58:06,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:58:06,832 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:06,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-20 19:58:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-20 19:58:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-20 19:58:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-20 19:58:06,866 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2024-11-20 19:58:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:06,868 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-20 19:58:06,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-20 19:58:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-20 19:58:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 19:58:06,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:06,871 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-20 19:58:06,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 19:58:07,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-20 19:58:07,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 13015132, now seen corresponding path program 1 times [2024-11-20 19:58:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571708292] [2024-11-20 19:58:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:58:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:58:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:58:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 19:58:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:58:07,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571708292] [2024-11-20 19:58:07,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571708292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:58:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891405398] [2024-11-20 19:58:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:07,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:58:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:07,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:58:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 19:58:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 19:58:07,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:07,282 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-20 19:58:07,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891405398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:58:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 19:58:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802887983] [2024-11-20 19:58:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:07,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:58:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:58:07,284 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-20 19:58:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:07,294 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-20 19:58:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-20 19:58:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:07,295 INFO L225 Difference]: With dead ends: 32 [2024-11-20 19:58:07,295 INFO L226 Difference]: Without dead ends: 23 [2024-11-20 19:58:07,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:58:07,296 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:07,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-20 19:58:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-20 19:58:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:58:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-20 19:58:07,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2024-11-20 19:58:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:07,303 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-20 19:58:07,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-20 19:58:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-20 19:58:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 19:58:07,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:07,306 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-20 19:58:07,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 19:58:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-20 19:58:07,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:07,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1035274573, now seen corresponding path program 1 times [2024-11-20 19:58:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169066583] [2024-11-20 19:58:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:58:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:58:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 19:58:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:07,615 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-20 19:58:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:58:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169066583] [2024-11-20 19:58:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169066583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:58:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010734169] [2024-11-20 19:58:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:58:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 19:58:07,622 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-20 19:58:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:07,633 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-20 19:58:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-20 19:58:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:07,634 INFO L225 Difference]: With dead ends: 23 [2024-11-20 19:58:07,634 INFO L226 Difference]: Without dead ends: 22 [2024-11-20 19:58:07,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 19:58:07,636 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:07,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-20 19:58:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 19:58:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:58:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-20 19:58:07,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 23 [2024-11-20 19:58:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:07,643 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-20 19:58:07,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-20 19:58:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-20 19:58:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 19:58:07,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:07,644 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, 1] [2024-11-20 19:58:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 19:58:07,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:07,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2028740759, now seen corresponding path program 1 times [2024-11-20 19:58:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096908006] [2024-11-20 19:58:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:07,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 19:58:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:07,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 19:58:07,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 19:58:07,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:58:07,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:58:07,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 19:58:07,710 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 19:58:07,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:58:07,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:58:07 BoogieIcfgContainer [2024-11-20 19:58:07,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:58:07,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:58:07,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:58:07,743 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:58:07,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:06" (3/4) ... [2024-11-20 19:58:07,746 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 19:58:07,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:58:07,748 INFO L158 Benchmark]: Toolchain (without parser) took 2900.72ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 75.8MB in the beginning and 92.9MB in the end (delta: -17.1MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,748 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:07,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.75ms. Allocated memory is still 148.9MB. Free memory was 75.4MB in the beginning and 66.8MB in the end (delta: 8.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.92ms. Allocated memory is still 148.9MB. Free memory was 66.8MB in the beginning and 63.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,750 INFO L158 Benchmark]: Boogie Preprocessor took 56.63ms. Allocated memory is still 148.9MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,750 INFO L158 Benchmark]: RCFGBuilder took 323.31ms. Allocated memory is still 148.9MB. Free memory was 61.5MB in the beginning and 46.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,750 INFO L158 Benchmark]: TraceAbstraction took 1635.06ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 45.9MB in the beginning and 92.9MB in the end (delta: -47.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-20 19:58:07,750 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 205.5MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:07,751 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.18ms. Allocated memory is still 148.9MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.75ms. Allocated memory is still 148.9MB. Free memory was 75.4MB in the beginning and 66.8MB in the end (delta: 8.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.92ms. Allocated memory is still 148.9MB. Free memory was 66.8MB in the beginning and 63.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.63ms. Allocated memory is still 148.9MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.31ms. Allocated memory is still 148.9MB. Free memory was 61.5MB in the beginning and 46.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1635.06ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 45.9MB in the beginning and 92.9MB in the end (delta: -47.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 205.5MB. Free memory is still 92.9MB. 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: 1569]: 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 1578, 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] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_preinc_11_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 globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() 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 globalReturnsTrue() [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) [L1566] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE globalReturnsTrue() [L1569] ++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: 1569]: 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 3 procedures, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 94 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 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-20 19:58:07,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 734d50c80d6cf17c396db83d36fca602dbddd3c09ab595026555aa5c7a4c0a2e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:58:09,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:58:09,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 19:58:09,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:58:09,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:58:09,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 19:58:09,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:58:09,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:58:09,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:58:09,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:58:09,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:58:09,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:58:09,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:58:09,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:58:09,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:58:09,683 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:58:09,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:58:09,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:58:09,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:58:09,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:58:09,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:58:09,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:58:09,684 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 19:58:09,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 19:58:09,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:58:09,685 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:58:09,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 19:58:09,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:58:09,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:58:09,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:58:09,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:58:09,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:58:09,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:58:09,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:58:09,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:09,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:58:09,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:58:09,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:58:09,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:58:09,689 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 734d50c80d6cf17c396db83d36fca602dbddd3c09ab595026555aa5c7a4c0a2e [2024-11-20 19:58:09,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:58:09,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:58:09,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:58:09,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:58:09,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:58:09,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:11,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:58:11,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:58:11,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:11,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5bb513d/4199878d7f7e41268b19df1c457a63e8/FLAG7c8324e50 [2024-11-20 19:58:11,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5bb513d/4199878d7f7e41268b19df1c457a63e8 [2024-11-20 19:58:11,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:58:11,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:58:11,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:11,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:58:11,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:58:11,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:11" (1/1) ... [2024-11-20 19:58:11,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca09dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:11, skipping insertion in model container [2024-11-20 19:58:11,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:11" (1/1) ... [2024-11-20 19:58:11,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:58:12,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:12,314 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:58:12,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:12,487 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:58:12,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12 WrapperNode [2024-11-20 19:58:12,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:12,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:12,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:58:12,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:58:12,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,551 INFO L138 Inliner]: procedures = 503, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-20 19:58:12,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:12,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:58:12,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:58:12,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:58:12,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,590 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-20 19:58:12,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:58:12,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:58:12,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:58:12,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:58:12,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (1/1) ... [2024-11-20 19:58:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:12,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 19:58:12,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 19:58:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 19:58:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 19:58:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-20 19:58:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-20 19:58:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 19:58:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:58:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:58:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:58:12,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:58:12,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:58:12,933 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-20 19:58:12,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:58:12,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:58:12,945 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:58:12,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:12 BoogieIcfgContainer [2024-11-20 19:58:12,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:58:12,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:58:12,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:58:12,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:58:12,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:58:11" (1/3) ... [2024-11-20 19:58:12,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df91552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:12, skipping insertion in model container [2024-11-20 19:58:12,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:12" (2/3) ... [2024-11-20 19:58:12,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df91552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:12, skipping insertion in model container [2024-11-20 19:58:12,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:12" (3/3) ... [2024-11-20 19:58:12,954 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_11_bad.i [2024-11-20 19:58:12,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:58:12,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:58:13,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:58:13,028 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;@2eaaac43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:58:13,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:58:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-20 19:58:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 19:58:13,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:13,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:13,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:13,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash -999678610, now seen corresponding path program 1 times [2024-11-20 19:58:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463993484] [2024-11-20 19:58:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:13,072 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-20 19:58:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:13,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-20 19:58:13,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-20 19:58:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:13,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 19:58:13,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:13,189 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-20 19:58:13,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:13,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 19:58:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463993484] [2024-11-20 19:58:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463993484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:13,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 19:58:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595973238] [2024-11-20 19:58:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 19:58:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 19:58:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 19:58:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:58:13,218 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 19:58:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:13,235 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-20 19:58:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 19:58:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-20 19:58:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:13,243 INFO L225 Difference]: With dead ends: 30 [2024-11-20 19:58:13,243 INFO L226 Difference]: Without dead ends: 22 [2024-11-20 19:58:13,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:58:13,250 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:13,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-20 19:58:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 19:58:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-20 19:58:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-20 19:58:13,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2024-11-20 19:58:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:13,282 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-20 19:58:13,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 19:58:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-20 19:58:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 19:58:13,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:13,283 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-20 19:58:13,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-20 19:58:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-20 19:58:13,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:13,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -925265772, now seen corresponding path program 1 times [2024-11-20 19:58:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:13,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539235094] [2024-11-20 19:58:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:13,489 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-20 19:58:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:13,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-20 19:58:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-20 19:58:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:13,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:58:13,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:58:13,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:13,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 19:58:13,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539235094] [2024-11-20 19:58:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539235094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 19:58:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338962466] [2024-11-20 19:58:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:58:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 19:58:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:58:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:58:13,732 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 19:58:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:13,744 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-20 19:58:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:58:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-20 19:58:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:13,745 INFO L225 Difference]: With dead ends: 30 [2024-11-20 19:58:13,745 INFO L226 Difference]: Without dead ends: 22 [2024-11-20 19:58:13,746 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-20 19:58:13,746 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:13,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-20 19:58:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 19:58:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-20 19:58:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-20 19:58:13,750 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2024-11-20 19:58:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:13,751 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-20 19:58:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 19:58:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-20 19:58:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 19:58:13,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:13,751 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-20 19:58:13,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 19:58:13,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-20 19:58:13,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:13,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash 442157657, now seen corresponding path program 1 times [2024-11-20 19:58:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:13,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212107275] [2024-11-20 19:58:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:13,964 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-20 19:58:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:13,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-20 19:58:13,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-20 19:58:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:14,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 19:58:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:14,097 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 19:58:14,097 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 19:58:14,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:58:14,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:58:14,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-20 19:58:14,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-20 19:58:14,305 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 19:58:14,333 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:58:14,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:58:14 BoogieIcfgContainer [2024-11-20 19:58:14,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:58:14,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:58:14,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:58:14,338 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:58:14,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:12" (3/4) ... [2024-11-20 19:58:14,340 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 19:58:14,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:58:14,342 INFO L158 Benchmark]: Toolchain (without parser) took 2656.73ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 37.3MB in the beginning and 45.0MB in the end (delta: -7.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-20 19:58:14,343 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:14,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.86ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 37.0MB in the beginning and 39.1MB in the end (delta: -2.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-20 19:58:14,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.00ms. Allocated memory is still 88.1MB. Free memory was 38.6MB in the beginning and 60.5MB in the end (delta: -21.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 19:58:14,346 INFO L158 Benchmark]: Boogie Preprocessor took 69.48ms. Allocated memory is still 88.1MB. Free memory was 60.5MB in the beginning and 57.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:14,346 INFO L158 Benchmark]: RCFGBuilder took 322.72ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 42.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:58:14,346 INFO L158 Benchmark]: TraceAbstraction took 1390.41ms. Allocated memory is still 88.1MB. Free memory was 41.6MB in the beginning and 45.5MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:14,346 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.0MB in the end (delta: 510.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:14,348 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.00ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 800.86ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 37.0MB in the beginning and 39.1MB in the end (delta: -2.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.00ms. Allocated memory is still 88.1MB. Free memory was 38.6MB in the beginning and 60.5MB in the end (delta: -21.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.48ms. Allocated memory is still 88.1MB. Free memory was 60.5MB in the beginning and 57.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.72ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 42.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1390.41ms. Allocated memory is still 88.1MB. Free memory was 41.6MB in the beginning and 45.5MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.0MB in the end (delta: 510.3kB). 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: 1569]: 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 1578, 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] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_preinc_11_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 globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() 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 globalReturnsTrue() [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) [L1566] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE globalReturnsTrue() [L1569] ++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: 1569]: 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 3 procedures, 30 locations, 2 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 4 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-20 19:58:14,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample