./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_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 3d97f958c2eac15f3b3863b00a1050ff4d49a756eeab5c3f3ea2a1e783e01769 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:53:10,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:53:10,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 18:53:10,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:53:10,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:53:10,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:53:10,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:53:10,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:53:10,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:53:10,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:53:10,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:53:10,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:53:10,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:53:10,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:53:10,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:53:10,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:53:10,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:53:10,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 18:53:10,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:53:10,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:53:10,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:53:10,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:53:10,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:53:10,282 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:53:10,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:53:10,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:53:10,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:53:10,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:53:10,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:53:10,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:53:10,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:53:10,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:53:10,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:53:10,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:53:10,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:53:10,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 18:53:10,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 18:53:10,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:53:10,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:53:10,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:53:10,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:53:10,286 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 -> 3d97f958c2eac15f3b3863b00a1050ff4d49a756eeab5c3f3ea2a1e783e01769 [2024-11-12 18:53:10,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:53:10,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:53:10,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:53:10,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:53:10,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:53:10,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:11,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:53:12,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:53:12,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:12,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f27f055/9fde522de81b4b2c8ccd2c9d14875868/FLAG9ac49f442 [2024-11-12 18:53:12,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f27f055/9fde522de81b4b2c8ccd2c9d14875868 [2024-11-12 18:53:12,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:53:12,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:53:12,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:53:12,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:53:12,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:53:12,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:12" (1/1) ... [2024-11-12 18:53:12,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2152cca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:12, skipping insertion in model container [2024-11-12 18:53:12,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:12" (1/1) ... [2024-11-12 18:53:12,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:53:13,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:53:13,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:53:13,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:53:13,330 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:53:13,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13 WrapperNode [2024-11-12 18:53:13,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:53:13,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:53:13,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:53:13,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:53:13,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,384 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-12 18:53:13,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:53:13,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:53:13,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:53:13,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:53:13,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,412 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 18:53:13,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:53:13,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:53:13,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:53:13,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:53:13,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (1/1) ... [2024-11-12 18:53:13,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:53:13,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:53:13,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 18:53:13,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 18:53:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:53:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:53:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:53:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:53:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:53:13,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:53:13,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:53:13,686 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 18:53:13,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:53:13,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:53:13,694 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:53:13,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:13 BoogieIcfgContainer [2024-11-12 18:53:13,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:53:13,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:53:13,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:53:13,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:53:13,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:53:12" (1/3) ... [2024-11-12 18:53:13,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28958cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:13, skipping insertion in model container [2024-11-12 18:53:13,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:13" (2/3) ... [2024-11-12 18:53:13,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28958cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:13, skipping insertion in model container [2024-11-12 18:53:13,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:13" (3/3) ... [2024-11-12 18:53:13,707 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:13,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:53:13,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:53:13,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:53:13,768 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;@35794722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:53:13,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:53:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:53:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 18:53:13,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:13,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:13,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1415283690, now seen corresponding path program 1 times [2024-11-12 18:53:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:53:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117818777] [2024-11-12 18:53:13,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:53:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:53:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:53:14,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:53:14,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117818777] [2024-11-12 18:53:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117818777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:53:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:53:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 18:53:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52277914] [2024-11-12 18:53:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:53:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 18:53:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:53:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 18:53:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 18:53:14,223 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 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) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:53:14,378 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-12 18:53:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 18:53:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 18:53:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:53:14,384 INFO L225 Difference]: With dead ends: 43 [2024-11-12 18:53:14,385 INFO L226 Difference]: Without dead ends: 14 [2024-11-12 18:53:14,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 18:53:14,391 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:53:14,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:53:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-12 18:53:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-12 18:53:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-11-12 18:53:14,437 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2024-11-12 18:53:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:53:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-11-12 18:53:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-11-12 18:53:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 18:53:14,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:14,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:14,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 18:53:14,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1415281768, now seen corresponding path program 1 times [2024-11-12 18:53:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:53:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210791799] [2024-11-12 18:53:14,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:53:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:53:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:53:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:53:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210791799] [2024-11-12 18:53:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210791799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:53:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:53:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:53:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662448757] [2024-11-12 18:53:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:53:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:53:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:53:14,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:53:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:53:14,514 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:53:14,519 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-11-12 18:53:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:53:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 18:53:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:53:14,520 INFO L225 Difference]: With dead ends: 14 [2024-11-12 18:53:14,520 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 18:53:14,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:53:14,521 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:53:14,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:53:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 18:53:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 18:53:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2024-11-12 18:53:14,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 11 [2024-11-12 18:53:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:53:14,524 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2024-11-12 18:53:14,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2024-11-12 18:53:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 18:53:14,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:14,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:14,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 18:53:14,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 924061903, now seen corresponding path program 1 times [2024-11-12 18:53:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:53:14,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596990107] [2024-11-12 18:53:14,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:53:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:53:14,535 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:53:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:53:14,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 18:53:14,554 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:53:14,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:53:14,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:53:14,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 18:53:14,558 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:53:14,578 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:53:14,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:53:14 BoogieIcfgContainer [2024-11-12 18:53:14,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:53:14,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:53:14,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:53:14,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:53:14,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:13" (3/4) ... [2024-11-12 18:53:14,583 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:53:14,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:53:14,585 INFO L158 Benchmark]: Toolchain (without parser) took 2062.73ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.5MB in the beginning and 197.0MB in the end (delta: -124.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:53:14,585 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 111.5MB in the end (delta: 305.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:53:14,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.28ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.1MB in the beginning and 189.2MB in the end (delta: -117.1MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:14,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 262.1MB. Free memory was 189.2MB in the beginning and 186.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 18:53:14,586 INFO L158 Benchmark]: Boogie Preprocessor took 33.71ms. Allocated memory is still 262.1MB. Free memory was 186.0MB in the beginning and 184.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:14,587 INFO L158 Benchmark]: RCFGBuilder took 274.44ms. Allocated memory is still 262.1MB. Free memory was 184.0MB in the beginning and 171.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 18:53:14,587 INFO L158 Benchmark]: TraceAbstraction took 883.43ms. Allocated memory is still 262.1MB. Free memory was 170.4MB in the beginning and 198.0MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:53:14,587 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 262.1MB. Free memory was 198.0MB in the beginning and 197.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:14,589 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.14ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 111.5MB in the end (delta: 305.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.28ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.1MB in the beginning and 189.2MB in the end (delta: -117.1MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 262.1MB. Free memory was 189.2MB in the beginning and 186.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.71ms. Allocated memory is still 262.1MB. Free memory was 186.0MB in the beginning and 184.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.44ms. Allocated memory is still 262.1MB. Free memory was 184.0MB in the beginning and 171.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 883.43ms. Allocated memory is still 262.1MB. Free memory was 170.4MB in the beginning and 198.0MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 262.1MB. Free memory was 198.0MB in the beginning and 197.0MB 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: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_fscanf_preinc_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1556] COND TRUE \read(GLOBAL_CONST_TRUE) 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] [L1559] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 26 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:53:14,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_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 3d97f958c2eac15f3b3863b00a1050ff4d49a756eeab5c3f3ea2a1e783e01769 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:53:16,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:53:16,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 18:53:16,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:53:16,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:53:16,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 18:53:16,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:53:16,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:53:16,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:53:16,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:53:16,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:53:16,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:53:16,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:53:16,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:53:16,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:53:16,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:53:16,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:53:16,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:53:16,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:53:16,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:53:16,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:53:16,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:53:16,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:53:16,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:53:16,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:53:16,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:53:16,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:53:16,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:53:16,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:53:16,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:53:16,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:53:16,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:53:16,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 18:53:16,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 18:53:16,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:53:16,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:53:16,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:53:16,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:53:16,957 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 -> 3d97f958c2eac15f3b3863b00a1050ff4d49a756eeab5c3f3ea2a1e783e01769 [2024-11-12 18:53:17,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:53:17,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:53:17,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:53:17,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:53:17,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:53:17,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:18,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:53:18,844 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:53:18,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:18,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8270e48a7/c46fc258a8bd46ef9f5d1c12debb4a10/FLAG9ccbe9dc9 [2024-11-12 18:53:18,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8270e48a7/c46fc258a8bd46ef9f5d1c12debb4a10 [2024-11-12 18:53:18,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:53:18,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:53:18,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:53:18,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:53:18,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:53:18,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:18" (1/1) ... [2024-11-12 18:53:18,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5475e25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:18, skipping insertion in model container [2024-11-12 18:53:18,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:18" (1/1) ... [2024-11-12 18:53:18,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:53:19,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:53:19,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:53:19,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:53:19,682 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:53:19,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19 WrapperNode [2024-11-12 18:53:19,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:53:19,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:53:19,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:53:19,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:53:19,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,733 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-12 18:53:19,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:53:19,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:53:19,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:53:19,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:53:19,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,764 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 18:53:19,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:53:19,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:53:19,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:53:19,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:53:19,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (1/1) ... [2024-11-12 18:53:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:53:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:53:19,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 18:53:19,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 18:53:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:53:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:53:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:53:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:53:19,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:53:19,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:53:19,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:53:20,124 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 18:53:20,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:53:20,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:53:20,139 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:53:20,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:20 BoogieIcfgContainer [2024-11-12 18:53:20,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:53:20,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:53:20,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:53:20,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:53:20,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:53:18" (1/3) ... [2024-11-12 18:53:20,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee8a6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:20, skipping insertion in model container [2024-11-12 18:53:20,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:19" (2/3) ... [2024-11-12 18:53:20,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee8a6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:20, skipping insertion in model container [2024-11-12 18:53:20,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:20" (3/3) ... [2024-11-12 18:53:20,157 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_09_bad.i [2024-11-12 18:53:20,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:53:20,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:53:20,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:53:20,250 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;@6bbdcf44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:53:20,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:53:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:53:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 18:53:20,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:20,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:20,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1415283690, now seen corresponding path program 1 times [2024-11-12 18:53:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:53:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579311807] [2024-11-12 18:53:20,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:20,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:20,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:53:20,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:53:20,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 18:53:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:20,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 18:53:20,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:53:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:53:20,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:53:20,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:53:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579311807] [2024-11-12 18:53:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579311807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:53:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:53:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 18:53:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873473357] [2024-11-12 18:53:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:53:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 18:53:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:53:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 18:53:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:53:20,407 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 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) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:53:20,420 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-12 18:53:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 18:53:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 18:53:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:53:20,426 INFO L225 Difference]: With dead ends: 21 [2024-11-12 18:53:20,427 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 18:53:20,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:53:20,431 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:53:20,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:53:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 18:53:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 18:53:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-12 18:53:20,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-12 18:53:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:53:20,455 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-12 18:53:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-12 18:53:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 18:53:20,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:20,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:20,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 18:53:20,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:20,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:20,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 924121485, now seen corresponding path program 1 times [2024-11-12 18:53:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:53:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976610746] [2024-11-12 18:53:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:20,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:53:20,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:53:20,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 18:53:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:53:20,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 18:53:20,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:53:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:53:20,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:53:20,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:53:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976610746] [2024-11-12 18:53:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976610746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:53:20,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:53:20,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:53:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524849768] [2024-11-12 18:53:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:53:20,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:53:20,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:53:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:53:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:53:20,742 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:53:20,747 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-12 18:53:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:53:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 18:53:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:53:20,748 INFO L225 Difference]: With dead ends: 17 [2024-11-12 18:53:20,748 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 18:53:20,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:53:20,749 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:53:20,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:53:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 18:53:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 18:53:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-12 18:53:20,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2024-11-12 18:53:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:53:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-12 18:53:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:53:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-12 18:53:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 18:53:20,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:53:20,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:53:20,756 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-11-12 18:53:20,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:20,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:53:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:53:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash 924061903, now seen corresponding path program 1 times [2024-11-12 18:53:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:53:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327668613] [2024-11-12 18:53:20,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:53:20,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:53:20,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:53:20,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 18:53:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:53:21,045 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:53:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:53:21,092 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 18:53:21,092 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:53:21,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:53:21,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:53:21,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 18:53:21,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:53:21,297 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:53:21,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:53:21,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:53:21 BoogieIcfgContainer [2024-11-12 18:53:21,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:53:21,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:53:21,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:53:21,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:53:21,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:20" (3/4) ... [2024-11-12 18:53:21,330 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:53:21,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:53:21,332 INFO L158 Benchmark]: Toolchain (without parser) took 2446.83ms. Allocated memory was 69.2MB in the beginning and 109.1MB in the end (delta: 39.8MB). Free memory was 45.8MB in the beginning and 75.1MB in the end (delta: -29.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,334 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:53:21,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.63ms. Allocated memory was 69.2MB in the beginning and 109.1MB in the end (delta: 39.8MB). Free memory was 45.6MB in the beginning and 61.9MB in the end (delta: -16.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 109.1MB. Free memory was 61.9MB in the beginning and 58.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,335 INFO L158 Benchmark]: Boogie Preprocessor took 55.02ms. Allocated memory is still 109.1MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,335 INFO L158 Benchmark]: RCFGBuilder took 352.01ms. Allocated memory is still 109.1MB. Free memory was 56.2MB in the beginning and 77.0MB in the end (delta: -20.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,335 INFO L158 Benchmark]: TraceAbstraction took 1180.52ms. Allocated memory is still 109.1MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-11-12 18:53:21,336 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 109.1MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:53:21,338 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.75ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.63ms. Allocated memory was 69.2MB in the beginning and 109.1MB in the end (delta: 39.8MB). Free memory was 45.6MB in the beginning and 61.9MB in the end (delta: -16.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 109.1MB. Free memory was 61.9MB in the beginning and 58.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.02ms. Allocated memory is still 109.1MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.01ms. Allocated memory is still 109.1MB. Free memory was 56.2MB in the beginning and 77.0MB in the end (delta: -20.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1180.52ms. Allocated memory is still 109.1MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 109.1MB. Free memory is still 75.1MB. 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: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_fscanf_preinc_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1556] COND TRUE \read(GLOBAL_CONST_TRUE) 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] [L1559] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:53:21,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample