./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:33:29,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:33:29,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 21:33:29,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:33:29,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:33:29,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:33:29,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:33:29,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:33:29,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:33:29,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:33:29,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:33:29,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:33:29,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:33:29,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:33:29,516 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:33:29,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:33:29,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:33:29,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 21:33:29,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:33:29,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:33:29,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:33:29,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:33:29,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:33:29,524 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:33:29,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:33:29,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:33:29,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:33:29,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:33:29,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:33:29,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:33:29,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:33:29,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:29,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:33:29,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:33:29,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:33:29,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 21:33:29,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 21:33:29,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:33:29,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:33:29,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:33:29,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:33:29,530 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-10-24 21:33:29,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:33:29,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:33:29,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:33:29,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:33:29,804 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:33:29,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:31,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:33:31,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:33:31,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:31,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246a798c8/532dab22f4fb44469ed35e64e62ad3b8/FLAG0ae318c55 [2024-10-24 21:33:31,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246a798c8/532dab22f4fb44469ed35e64e62ad3b8 [2024-10-24 21:33:31,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:33:31,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:33:31,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:31,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:33:31,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:33:31,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:31" (1/1) ... [2024-10-24 21:33:31,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2e2f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:31, skipping insertion in model container [2024-10-24 21:33:31,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:31" (1/1) ... [2024-10-24 21:33:31,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:33:32,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:32,453 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:33:32,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:32,686 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:33:32,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32 WrapperNode [2024-10-24 21:33:32,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:32,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:32,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:33:32,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:33:32,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,799 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-10-24 21:33:32,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:32,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:33:32,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:33:32,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:33:32,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,843 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-10-24 21:33:32,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:33:32,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:33:32,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:33:32,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:33:32,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (1/1) ... [2024-10-24 21:33:32,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:32,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:33:32,902 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-10-24 21:33:32,905 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-10-24 21:33:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:33:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:33:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:33:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:33:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:33:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 21:33:33,075 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:33:33,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:33:33,191 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-24 21:33:33,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:33:33,223 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:33:33,224 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 21:33:33,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:33 BoogieIcfgContainer [2024-10-24 21:33:33,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:33:33,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:33:33,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:33:33,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:33:33,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:31" (1/3) ... [2024-10-24 21:33:33,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c4aa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:33, skipping insertion in model container [2024-10-24 21:33:33,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:32" (2/3) ... [2024-10-24 21:33:33,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c4aa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:33, skipping insertion in model container [2024-10-24 21:33:33,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:33" (3/3) ... [2024-10-24 21:33:33,234 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:33,249 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:33:33,250 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 21:33:33,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:33:33,307 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;@357df9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:33:33,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 21:33:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 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-10-24 21:33:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 21:33:33,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:33,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:33,321 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-10-24 21:33:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash -899995481, now seen corresponding path program 1 times [2024-10-24 21:33:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30775082] [2024-10-24 21:33:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30775082] [2024-10-24 21:33:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30775082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477062303] [2024-10-24 21:33:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:33,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:33:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:33:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:33:33,738 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:33,794 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-10-24 21:33:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:33:33,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 21:33:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:33,820 INFO L225 Difference]: With dead ends: 53 [2024-10-24 21:33:33,820 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 21:33:33,823 INFO L431 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-10-24 21:33:33,826 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:33,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 21:33:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-10-24 21:33:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 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-10-24 21:33:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-24 21:33:33,866 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2024-10-24 21:33:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:33,867 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-24 21:33:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-24 21:33:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 21:33:33,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:33,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:33,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 21:33:33,871 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-10-24 21:33:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -899950299, now seen corresponding path program 1 times [2024-10-24 21:33:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560755856] [2024-10-24 21:33:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560755856] [2024-10-24 21:33:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560755856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37610347] [2024-10-24 21:33:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:33:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:33:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:34,058 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:34,107 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-24 21:33:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:33:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 21:33:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:34,110 INFO L225 Difference]: With dead ends: 35 [2024-10-24 21:33:34,110 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 21:33:34,111 INFO L431 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-10-24 21:33:34,112 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:34,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 21:33:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 21:33:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 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-10-24 21:33:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-24 21:33:34,124 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2024-10-24 21:33:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:34,124 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-24 21:33:34,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-24 21:33:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 21:33:34,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:34,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 21:33:34,126 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-10-24 21:33:34,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash 82963507, now seen corresponding path program 1 times [2024-10-24 21:33:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017228327] [2024-10-24 21:33:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017228327] [2024-10-24 21:33:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017228327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:34,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649204900] [2024-10-24 21:33:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:33:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:34,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:33:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:34,258 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-10-24 21:33:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:34,293 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-24 21:33:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:33:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2024-10-24 21:33:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:34,297 INFO L225 Difference]: With dead ends: 33 [2024-10-24 21:33:34,297 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 21:33:34,297 INFO L431 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-10-24 21:33:34,299 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 21:33:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 21:33:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 21:33:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-24 21:33:34,315 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2024-10-24 21:33:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-24 21:33:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-10-24 21:33:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-24 21:33:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 21:33:34,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:34,318 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:34,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 21:33:34,319 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-10-24 21:33:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:34,320 INFO L85 PathProgramCache]: Analyzing trace with hash 83008689, now seen corresponding path program 1 times [2024-10-24 21:33:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741948182] [2024-10-24 21:33:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:34,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741948182] [2024-10-24 21:33:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741948182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 21:33:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015282601] [2024-10-24 21:33:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:34,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 21:33:34,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:33:34,406 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-10-24 21:33:34,408 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-10-24 21:33:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:34,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 21:33:34,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:34,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015282601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 21:33:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 21:33:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101240159] [2024-10-24 21:33:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 21:33:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 21:33:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 21:33:34,565 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10-24 21:33:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:34,600 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-10-24 21:33:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 21:33:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2024-10-24 21:33:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:34,605 INFO L225 Difference]: With dead ends: 46 [2024-10-24 21:33:34,608 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 21:33:34,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-10-24 21:33:34,610 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:34,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 21:33:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 21:33:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 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-10-24 21:33:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-24 21:33:34,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2024-10-24 21:33:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:34,618 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-24 21:33:34,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10-24 21:33:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-24 21:33:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 21:33:34,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:34,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 21:33:34,824 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-10-24 21:33:34,825 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-10-24 21:33:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1723098498, now seen corresponding path program 1 times [2024-10-24 21:33:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601566191] [2024-10-24 21:33:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:34,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:33:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:34,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 21:33:34,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:33:34,885 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 21:33:34,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 21:33:34,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 21:33:34,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 21:33:34,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 21:33:34,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 21:33:34,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 21:33:34,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 21:33:34,922 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:33:34,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:33:34 BoogieIcfgContainer [2024-10-24 21:33:34,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:33:34,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:33:34,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:33:34,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:33:34,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:33" (3/4) ... [2024-10-24 21:33:34,929 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:33:34,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:33:34,931 INFO L158 Benchmark]: Toolchain (without parser) took 3262.70ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 122.5MB in the beginning and 98.3MB in the end (delta: 24.1MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,931 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:34,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1018.46ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 100.9MB in the end (delta: 21.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.27ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 98.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:34,932 INFO L158 Benchmark]: Boogie Preprocessor took 62.73ms. Allocated memory is still 157.3MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,932 INFO L158 Benchmark]: RCFGBuilder took 357.78ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 80.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,932 INFO L158 Benchmark]: TraceAbstraction took 1698.92ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 79.2MB in the beginning and 99.4MB in the end (delta: -20.2MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,933 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 192.9MB. Free memory was 99.4MB in the beginning and 98.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:34,934 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.17ms. Allocated memory is still 125.8MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1018.46ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 100.9MB in the end (delta: 21.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.27ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 98.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.73ms. Allocated memory is still 157.3MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.78ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 80.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1698.92ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 79.2MB in the beginning and 99.4MB in the end (delta: -20.2MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 192.9MB. Free memory was 99.4MB in the beginning and 98.3MB 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 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); [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 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: 1570]: 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, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 97 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 8/9 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-10-24 21:33:34,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:33:37,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:33:37,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 21:33:37,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:33:37,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:33:37,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 21:33:37,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:33:37,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:33:37,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:33:37,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:33:37,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:33:37,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:33:37,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:33:37,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:33:37,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:33:37,304 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:33:37,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:33:37,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:33:37,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:33:37,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:33:37,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:33:37,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:33:37,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 21:33:37,308 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 21:33:37,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:33:37,309 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:33:37,309 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 21:33:37,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:33:37,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:33:37,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:33:37,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:33:37,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:33:37,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:33:37,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:33:37,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:37,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:33:37,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:33:37,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:33:37,314 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 21:33:37,314 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 21:33:37,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:33:37,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:33:37,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:33:37,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:33:37,315 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 21:33:37,315 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-10-24 21:33:37,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:33:37,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:33:37,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:33:37,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:33:37,672 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:33:37,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:39,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:33:39,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:33:39,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:39,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc1e913a/33091706ce7b4342b16d195b4a6ba2ed/FLAG974885832 [2024-10-24 21:33:39,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc1e913a/33091706ce7b4342b16d195b4a6ba2ed [2024-10-24 21:33:39,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:33:39,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:33:39,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:39,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:33:39,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:33:39,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:39" (1/1) ... [2024-10-24 21:33:39,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a0759e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:39, skipping insertion in model container [2024-10-24 21:33:39,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:39" (1/1) ... [2024-10-24 21:33:39,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:33:40,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:40,800 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:33:40,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:41,029 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:33:41,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41 WrapperNode [2024-10-24 21:33:41,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:41,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:41,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:33:41,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:33:41,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,091 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-10-24 21:33:41,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:41,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:33:41,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:33:41,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:33:41,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,126 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-10-24 21:33:41,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:33:41,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:33:41,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:33:41,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:33:41,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (1/1) ... [2024-10-24 21:33:41,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:33:41,196 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-10-24 21:33:41,200 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-10-24 21:33:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:33:41,237 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:33:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 21:33:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:33:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:33:41,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:33:41,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:33:41,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:33:41,585 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-24 21:33:41,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:33:41,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:33:41,630 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 21:33:41,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:41 BoogieIcfgContainer [2024-10-24 21:33:41,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:33:41,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:33:41,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:33:41,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:33:41,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:39" (1/3) ... [2024-10-24 21:33:41,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:41, skipping insertion in model container [2024-10-24 21:33:41,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:41" (2/3) ... [2024-10-24 21:33:41,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:41, skipping insertion in model container [2024-10-24 21:33:41,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:41" (3/3) ... [2024-10-24 21:33:41,640 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-10-24 21:33:41,658 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:33:41,659 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 21:33:41,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:33:41,729 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;@3eaf8371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:33:41,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 21:33:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 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-10-24 21:33:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 21:33:41,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:41,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:41,741 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-10-24 21:33:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -899995481, now seen corresponding path program 1 times [2024-10-24 21:33:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:41,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235173122] [2024-10-24 21:33:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:41,761 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-10-24 21:33:41,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:41,765 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-10-24 21:33:41,767 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-10-24 21:33:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:41,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 21:33:41,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:41,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:41,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:33:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235173122] [2024-10-24 21:33:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235173122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 21:33:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999231358] [2024-10-24 21:33:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 21:33:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:33:41,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 21:33:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:33:41,926 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:41,953 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-24 21:33:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 21:33:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 21:33:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:41,962 INFO L225 Difference]: With dead ends: 46 [2024-10-24 21:33:41,963 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 21:33:41,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:33:41,969 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:41,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 21:33:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 21:33:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-10-24 21:33:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-24 21:33:42,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2024-10-24 21:33:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:42,005 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-24 21:33:42,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-24 21:33:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 21:33:42,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:42,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:42,012 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-10-24 21:33:42,208 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-10-24 21:33:42,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 21:33:42,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2130056054, now seen corresponding path program 1 times [2024-10-24 21:33:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397886296] [2024-10-24 21:33:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:42,211 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-10-24 21:33:42,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:42,213 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-10-24 21:33:42,214 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-10-24 21:33:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:42,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 21:33:42,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:42,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:42,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:33:42,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397886296] [2024-10-24 21:33:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397886296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455819289] [2024-10-24 21:33:42,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:33:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:33:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:33:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:33:42,325 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:42,346 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-10-24 21:33:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:33:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 21:33:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:42,347 INFO L225 Difference]: With dead ends: 36 [2024-10-24 21:33:42,347 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 21:33:42,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:33:42,349 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:42,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 21:33:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-24 21:33:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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-10-24 21:33:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-24 21:33:42,355 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2024-10-24 21:33:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:42,355 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-24 21:33:42,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-24 21:33:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 21:33:42,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:42,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:42,362 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 (3)] Ended with exit code 0 [2024-10-24 21:33:42,560 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-10-24 21:33:42,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 21:33:42,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2128655428, now seen corresponding path program 1 times [2024-10-24 21:33:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309703287] [2024-10-24 21:33:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:42,562 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-10-24 21:33:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:42,566 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-10-24 21:33:42,568 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-10-24 21:33:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:42,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 21:33:42,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:42,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:42,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:33:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309703287] [2024-10-24 21:33:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309703287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:42,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:42,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859550741] [2024-10-24 21:33:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:33:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:33:42,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:33:42,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:42,665 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:42,693 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-24 21:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:33:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 21:33:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:42,695 INFO L225 Difference]: With dead ends: 31 [2024-10-24 21:33:42,696 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 21:33:42,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:42,698 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:42,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 21:33:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-24 21:33:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 21:33:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-24 21:33:42,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2024-10-24 21:33:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:42,706 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-24 21:33:42,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-24 21:33:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 21:33:42,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:42,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:42,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 21:33:42,909 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-10-24 21:33:42,910 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-10-24 21:33:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1723098498, now seen corresponding path program 1 times [2024-10-24 21:33:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111017475] [2024-10-24 21:33:42,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:42,912 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-10-24 21:33:42,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:42,915 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-10-24 21:33:42,916 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-10-24 21:33:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:42,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:33:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:43,042 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 21:33:43,046 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:33:43,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 21:33:43,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 21:33:43,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 21:33:43,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 21:33:43,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 21:33:43,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 21:33:43,061 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-10-24 21:33:43,255 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-10-24 21:33:43,258 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 21:33:43,280 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:33:43,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:33:43 BoogieIcfgContainer [2024-10-24 21:33:43,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:33:43,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:33:43,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:33:43,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:33:43,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:41" (3/4) ... [2024-10-24 21:33:43,287 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:33:43,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:33:43,289 INFO L158 Benchmark]: Toolchain (without parser) took 3521.57ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 43.7MB in the beginning and 34.9MB in the end (delta: 8.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,289 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 46.1MB. Free memory was 27.3MB in the beginning and 27.3MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:43,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1262.56ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 54.5MB in the end (delta: -11.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.70ms. Allocated memory is still 88.1MB. Free memory was 54.5MB in the beginning and 51.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,290 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 48.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,291 INFO L158 Benchmark]: RCFGBuilder took 471.50ms. Allocated memory is still 88.1MB. Free memory was 48.2MB in the beginning and 55.6MB in the end (delta: -7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,291 INFO L158 Benchmark]: TraceAbstraction took 1650.87ms. Allocated memory is still 88.1MB. Free memory was 55.0MB in the beginning and 35.5MB in the end (delta: 19.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-24 21:33:43,291 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 88.1MB. Free memory was 35.5MB in the beginning and 34.9MB in the end (delta: 616.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:43,293 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.21ms. Allocated memory is still 46.1MB. Free memory was 27.3MB in the beginning and 27.3MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1262.56ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 54.5MB in the end (delta: -11.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.70ms. Allocated memory is still 88.1MB. Free memory was 54.5MB in the beginning and 51.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 48.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.50ms. Allocated memory is still 88.1MB. Free memory was 48.2MB in the beginning and 55.6MB in the end (delta: -7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1650.87ms. Allocated memory is still 88.1MB. Free memory was 55.0MB in the beginning and 35.5MB in the end (delta: 19.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 88.1MB. Free memory was 35.5MB in the beginning and 34.9MB in the end (delta: 616.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of 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); [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 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: 1570]: 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, 30 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, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 21:33:43,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample