./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_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 0a8c14371ace8836790ae923a60e10c38311139c7ebd218dd2592fea3c4c0de9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:39:16,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:39:17,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 18:39:17,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:39:17,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:39:17,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:39:17,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:39:17,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:39:17,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:39:17,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:39:17,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:39:17,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:39:17,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:39:17,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:39:17,062 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:39:17,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:39:17,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:39:17,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 18:39:17,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:39:17,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:39:17,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:39:17,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:39:17,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:39:17,067 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:39:17,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:39:17,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:39:17,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:39:17,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:39:17,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:39:17,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:39:17,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:39:17,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:39:17,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:39:17,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:39:17,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:39:17,071 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 -> 0a8c14371ace8836790ae923a60e10c38311139c7ebd218dd2592fea3c4c0de9 [2024-11-12 18:39:17,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:39:17,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:39:17,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:39:17,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:39:17,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:39:17,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:18,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:39:18,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:39:18,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:18,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e58e0853/bc22c5ccf0c9431d98b18a0a44bcfbf6/FLAGa0c7fa7d4 [2024-11-12 18:39:18,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e58e0853/bc22c5ccf0c9431d98b18a0a44bcfbf6 [2024-11-12 18:39:18,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:39:18,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:39:18,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:39:18,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:39:18,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:39:18,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:39:18" (1/1) ... [2024-11-12 18:39:18,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8019d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:18, skipping insertion in model container [2024-11-12 18:39:18,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:39:18" (1/1) ... [2024-11-12 18:39:18,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:39:19,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:39:19,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:39:19,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:39:19,726 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:39:19,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19 WrapperNode [2024-11-12 18:39:19,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:39:19,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:39:19,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:39:19,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:39:19,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,769 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2024-11-12 18:39:19,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:39:19,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:39:19,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:39:19,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:39:19,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,788 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-12 18:39:19,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:39:19,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:39:19,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:39:19,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:39:19,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (1/1) ... [2024-11-12 18:39:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:39:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:39:19,839 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-12 18:39:19,841 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-12 18:39:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:39:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:39:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:39:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:39:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:39:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 18:39:19,992 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:39:19,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:39:20,089 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-12 18:39:20,089 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:39:20,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:39:20,099 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 18:39:20,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:20 BoogieIcfgContainer [2024-11-12 18:39:20,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:39:20,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:39:20,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:39:20,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:39:20,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:39:18" (1/3) ... [2024-11-12 18:39:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791002f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:39:20, skipping insertion in model container [2024-11-12 18:39:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:19" (2/3) ... [2024-11-12 18:39:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791002f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:39:20, skipping insertion in model container [2024-11-12 18:39:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:20" (3/3) ... [2024-11-12 18:39:20,106 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:20,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:39:20,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 18:39:20,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:39:20,186 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;@5771afee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:39:20,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 18:39:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 18:39:20,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:20,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:20,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:20,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash -705347075, now seen corresponding path program 1 times [2024-11-12 18:39:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:39:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420920468] [2024-11-12 18:39:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:39:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:39:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:39:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420920468] [2024-11-12 18:39:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420920468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:39:20,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403778174] [2024-11-12 18:39:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:39:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:39:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:39:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:39:20,433 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:20,459 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-11-12 18:39:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:39:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 18:39:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:20,467 INFO L225 Difference]: With dead ends: 66 [2024-11-12 18:39:20,467 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 18:39:20,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 18:39:20,472 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:20,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 18:39:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2024-11-12 18:39:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:39:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-12 18:39:20,504 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2024-11-12 18:39:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-12 18:39:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-12 18:39:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 18:39:20,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:20,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:20,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 18:39:20,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:20,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash -703994595, now seen corresponding path program 1 times [2024-11-12 18:39:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:39:20,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510510892] [2024-11-12 18:39:20,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:39:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:39:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:39:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510510892] [2024-11-12 18:39:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510510892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:39:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085452519] [2024-11-12 18:39:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:20,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 18:39:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:39:20,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 18:39:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:39:20,648 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:20,685 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-12 18:39:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 18:39:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 18:39:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:20,686 INFO L225 Difference]: With dead ends: 41 [2024-11-12 18:39:20,686 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 18:39:20,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:39:20,688 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:20,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 18:39:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-12 18:39:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-12 18:39:20,696 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 13 [2024-11-12 18:39:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:20,697 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-12 18:39:20,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-12 18:39:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 18:39:20,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:20,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:20,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 18:39:20,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:20,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:20,699 INFO L85 PathProgramCache]: Analyzing trace with hash -837890922, now seen corresponding path program 1 times [2024-11-12 18:39:20,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:39:20,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623624300] [2024-11-12 18:39:20,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:39:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:39:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 18:39:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:39:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623624300] [2024-11-12 18:39:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623624300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:20,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:39:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803990287] [2024-11-12 18:39:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:20,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:39:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:39:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:39:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:39:20,789 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:20,807 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-12 18:39:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:39:20,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 18:39:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:20,808 INFO L225 Difference]: With dead ends: 57 [2024-11-12 18:39:20,808 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 18:39:20,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:39:20,810 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:20,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 18:39:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-12 18:39:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-12 18:39:20,815 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 19 [2024-11-12 18:39:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:20,816 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-12 18:39:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-12 18:39:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 18:39:20,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:20,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 18:39:20,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:20,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -836538442, now seen corresponding path program 1 times [2024-11-12 18:39:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:39:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163866418] [2024-11-12 18:39:20,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:39:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:39:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:39:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163866418] [2024-11-12 18:39:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163866418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 18:39:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570140853] [2024-11-12 18:39:20,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:20,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 18:39:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:39:20,911 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-12 18:39:20,927 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-12 18:39:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:21,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 18:39:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:39:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:21,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:39:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570140853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:21,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 18:39:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 18:39:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823163537] [2024-11-12 18:39:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:21,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 18:39:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:39:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 18:39:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 18:39:21,110 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:21,139 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-11-12 18:39:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 18:39:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 18:39:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:21,141 INFO L225 Difference]: With dead ends: 65 [2024-11-12 18:39:21,141 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 18:39:21,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 18:39:21,142 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:21,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 18:39:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 18:39:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:39:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-12 18:39:21,151 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2024-11-12 18:39:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:21,151 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-12 18:39:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-12 18:39:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 18:39:21,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:21,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:21,166 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-12 18:39:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 18:39:21,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash -204814722, now seen corresponding path program 1 times [2024-11-12 18:39:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:39:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078892897] [2024-11-12 18:39:21,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:39:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:39:21,382 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:39:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:39:21,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 18:39:21,426 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:39:21,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 18:39:21,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 18:39:21,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 18:39:21,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 18:39:21,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 18:39:21,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 18:39:21,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 18:39:21,435 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 18:39:21,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:39:21,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:39:21 BoogieIcfgContainer [2024-11-12 18:39:21,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:39:21,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:39:21,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:39:21,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:39:21,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:20" (3/4) ... [2024-11-12 18:39:21,475 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:39:21,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:39:21,476 INFO L158 Benchmark]: Toolchain (without parser) took 2598.28ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 115.3MB in the beginning and 105.9MB in the end (delta: 9.4MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,476 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:39:21,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.25ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 114.8MB in the beginning and 229.6MB in the end (delta: -114.8MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.69ms. Allocated memory is still 289.4MB. Free memory was 229.6MB in the beginning and 227.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,481 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 289.4MB. Free memory was 227.5MB in the beginning and 224.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,481 INFO L158 Benchmark]: RCFGBuilder took 301.62ms. Allocated memory is still 289.4MB. Free memory was 224.4MB in the beginning and 209.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,481 INFO L158 Benchmark]: TraceAbstraction took 1371.33ms. Allocated memory is still 289.4MB. Free memory was 208.7MB in the beginning and 107.0MB in the end (delta: 101.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,482 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 289.4MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:39:21,483 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.15ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.25ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 114.8MB in the beginning and 229.6MB in the end (delta: -114.8MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.69ms. Allocated memory is still 289.4MB. Free memory was 229.6MB in the beginning and 227.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 289.4MB. Free memory was 227.5MB in the beginning and 224.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.62ms. Allocated memory is still 289.4MB. Free memory was 224.4MB in the beginning and 209.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1371.33ms. Allocated memory is still 289.4MB. Free memory was 208.7MB in the beginning and 107.0MB in the end (delta: 101.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 289.4MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); 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 printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 143 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 10/11 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-12 18:39:21,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_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 0a8c14371ace8836790ae923a60e10c38311139c7ebd218dd2592fea3c4c0de9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:39:23,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:39:23,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 18:39:23,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:39:23,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:39:23,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 18:39:23,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:39:23,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:39:23,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:39:23,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:39:23,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:39:23,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:39:23,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:39:23,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:39:23,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:39:23,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:39:23,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:39:23,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:39:23,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:39:23,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:39:23,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:39:23,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:39:23,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 18:39:23,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 18:39:23,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:39:23,548 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:39:23,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 18:39:23,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:39:23,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:39:23,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:39:23,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:39:23,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:39:23,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:39:23,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:39:23,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:39:23,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:39:23,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:39:23,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:39:23,550 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 18:39:23,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 18:39:23,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:39:23,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:39:23,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:39:23,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:39:23,551 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 -> 0a8c14371ace8836790ae923a60e10c38311139c7ebd218dd2592fea3c4c0de9 [2024-11-12 18:39:23,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:39:23,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:39:23,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:39:23,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:39:23,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:39:23,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:25,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:39:25,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:39:25,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:25,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc94a3a1/34cce76b50894e5dacd18e489aa4607c/FLAG7ab3d609b [2024-11-12 18:39:25,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc94a3a1/34cce76b50894e5dacd18e489aa4607c [2024-11-12 18:39:25,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:39:25,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:39:25,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:39:25,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:39:25,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:39:25,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:39:25" (1/1) ... [2024-11-12 18:39:25,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@828f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:25, skipping insertion in model container [2024-11-12 18:39:25,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:39:25" (1/1) ... [2024-11-12 18:39:25,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:39:26,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:39:26,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:39:27,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:39:27,347 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:39:27,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27 WrapperNode [2024-11-12 18:39:27,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:39:27,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:39:27,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:39:27,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:39:27,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,457 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2024-11-12 18:39:27,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:39:27,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:39:27,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:39:27,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:39:27,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,501 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-12 18:39:27,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:39:27,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:39:27,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:39:27,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:39:27,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (1/1) ... [2024-11-12 18:39:27,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:39:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:39:27,583 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-12 18:39:27,592 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-12 18:39:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:39:27,623 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:39:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 18:39:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:39:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:39:27,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:39:27,750 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:39:27,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:39:27,888 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-12 18:39:27,888 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:39:27,901 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:39:27,902 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 18:39:27,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:27 BoogieIcfgContainer [2024-11-12 18:39:27,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:39:27,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:39:27,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:39:27,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:39:27,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:39:25" (1/3) ... [2024-11-12 18:39:27,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710eb757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:39:27, skipping insertion in model container [2024-11-12 18:39:27,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:39:27" (2/3) ... [2024-11-12 18:39:27,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710eb757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:39:27, skipping insertion in model container [2024-11-12 18:39:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:27" (3/3) ... [2024-11-12 18:39:27,909 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_bad.i [2024-11-12 18:39:27,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:39:27,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 18:39:27,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:39:27,972 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;@a879cb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:39:27,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 18:39:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 18:39:27,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:27,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:27,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash -705347075, now seen corresponding path program 1 times [2024-11-12 18:39:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:39:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660958399] [2024-11-12 18:39:27,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:27,996 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-12 18:39:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:39:27,999 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-12 18:39:28,004 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-12 18:39:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:28,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 18:39:28,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:39:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:28,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:39:28,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:39:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660958399] [2024-11-12 18:39:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660958399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:28,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:28,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:39:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314812817] [2024-11-12 18:39:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:28,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:39:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:39:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:39:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:39:28,155 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:28,179 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-11-12 18:39:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:39:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 18:39:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:28,185 INFO L225 Difference]: With dead ends: 65 [2024-11-12 18:39:28,185 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 18:39:28,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12 18:39:28,189 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:28,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 18:39:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-11-12 18:39:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:39:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-12 18:39:28,229 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 13 [2024-11-12 18:39:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-12 18:39:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-12 18:39:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 18:39:28,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:28,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:28,235 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-12 18:39:28,433 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-12 18:39:28,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:28,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -348995900, now seen corresponding path program 1 times [2024-11-12 18:39:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:39:28,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099653661] [2024-11-12 18:39:28,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:28,436 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-12 18:39:28,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:39:28,439 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-12 18:39:28,440 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-12 18:39:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:28,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 18:39:28,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:39:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:39:28,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:39:28,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:39:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099653661] [2024-11-12 18:39:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099653661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:39:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941350945] [2024-11-12 18:39:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 18:39:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:39:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 18:39:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:39:28,700 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:28,747 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-11-12 18:39:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 18:39:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 18:39:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:28,748 INFO L225 Difference]: With dead ends: 38 [2024-11-12 18:39:28,749 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 18:39:28,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-12 18:39:28,750 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:28,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 18:39:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 18:39:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-12 18:39:28,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 14 [2024-11-12 18:39:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-12 18:39:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-12 18:39:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 18:39:28,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:28,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:28,770 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-12 18:39:28,966 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-12 18:39:28,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:28,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash -837890922, now seen corresponding path program 1 times [2024-11-12 18:39:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:39:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358039738] [2024-11-12 18:39:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:28,969 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-12 18:39:28,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:39:28,971 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-12 18:39:28,973 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-12 18:39:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:39:29,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 18:39:29,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:39:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 18:39:29,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:39:29,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:39:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358039738] [2024-11-12 18:39:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358039738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:39:29,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:39:29,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:39:29,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645970145] [2024-11-12 18:39:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:39:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:39:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:39:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:39:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:39:29,036 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:39:29,051 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-12 18:39:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:39:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 18:39:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:39:29,052 INFO L225 Difference]: With dead ends: 53 [2024-11-12 18:39:29,052 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 18:39:29,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-12 18:39:29,053 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:39:29,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:39:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 18:39:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-12 18:39:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:39:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-12 18:39:29,057 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 19 [2024-11-12 18:39:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:39:29,058 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-12 18:39:29,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:39:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-12 18:39:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 18:39:29,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:39:29,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:39:29,063 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 18:39:29,262 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-12 18:39:29,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 18:39:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:39:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash -204814722, now seen corresponding path program 1 times [2024-11-12 18:39:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:39:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555549000] [2024-11-12 18:39:29,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:39:29,268 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-12 18:39:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:39:29,271 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 18:39:29,272 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 (5)] Waiting until timeout for monitored process [2024-11-12 18:39:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:39:29,325 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:39:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:39:29,389 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 18:39:29,389 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:39:29,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 18:39:29,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 18:39:29,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 18:39:29,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 18:39:29,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 18:39:29,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 18:39:29,399 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 (5)] Ended with exit code 0 [2024-11-12 18:39:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 18:39:29,598 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 18:39:29,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:39:29,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:39:29 BoogieIcfgContainer [2024-11-12 18:39:29,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:39:29,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:39:29,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:39:29,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:39:29,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:39:27" (3/4) ... [2024-11-12 18:39:29,625 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:39:29,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:39:29,626 INFO L158 Benchmark]: Toolchain (without parser) took 3820.84ms. Allocated memory was 81.8MB in the beginning and 127.9MB in the end (delta: 46.1MB). Free memory was 43.0MB in the beginning and 69.3MB in the end (delta: -26.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,627 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:39:29,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1545.22ms. Allocated memory was 81.8MB in the beginning and 127.9MB in the end (delta: 46.1MB). Free memory was 42.8MB in the beginning and 65.8MB in the end (delta: -23.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.76ms. Allocated memory is still 127.9MB. Free memory was 65.2MB in the beginning and 97.8MB in the end (delta: -32.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,631 INFO L158 Benchmark]: Boogie Preprocessor took 71.33ms. Allocated memory is still 127.9MB. Free memory was 97.8MB in the beginning and 95.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,631 INFO L158 Benchmark]: RCFGBuilder took 371.17ms. Allocated memory is still 127.9MB. Free memory was 95.0MB in the beginning and 79.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,631 INFO L158 Benchmark]: TraceAbstraction took 1718.97ms. Allocated memory is still 127.9MB. Free memory was 78.3MB in the beginning and 69.8MB in the end (delta: 8.5MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-12 18:39:29,631 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 127.9MB. Free memory was 69.8MB in the beginning and 69.3MB in the end (delta: 482.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:39:29,632 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.19ms. Allocated memory is still 81.8MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1545.22ms. Allocated memory was 81.8MB in the beginning and 127.9MB in the end (delta: 46.1MB). Free memory was 42.8MB in the beginning and 65.8MB in the end (delta: -23.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.76ms. Allocated memory is still 127.9MB. Free memory was 65.2MB in the beginning and 97.8MB in the end (delta: -32.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.33ms. Allocated memory is still 127.9MB. Free memory was 97.8MB in the beginning and 95.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.17ms. Allocated memory is still 127.9MB. Free memory was 95.0MB in the beginning and 79.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1718.97ms. Allocated memory is still 127.9MB. Free memory was 78.3MB in the beginning and 69.8MB in the end (delta: 8.5MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 127.9MB. Free memory was 69.8MB in the beginning and 69.3MB in the end (delta: 482.2kB). 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: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); 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 printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 106 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:39:29,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample