./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c41f1a35be3bdee39c0ea9db71017edc7b5c3177c5de3b7ca0d08cdcb96fb896 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:11:08,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:11:08,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:11:08,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:11:08,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:11:08,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:11:08,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:11:08,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:11:08,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:11:08,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:11:08,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:11:08,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:11:08,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:11:08,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:11:08,221 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:11:08,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:11:08,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:11:08,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:11:08,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:11:08,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:11:08,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:11:08,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:11:08,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:11:08,224 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:11:08,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:11:08,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:11:08,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:11:08,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:11:08,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:11:08,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:11:08,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:11:08,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:08,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:11:08,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:11:08,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:11:08,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:11:08,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:11:08,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:11:08,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:11:08,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:11:08,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:11:08,238 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-clean/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-clean/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 -> c41f1a35be3bdee39c0ea9db71017edc7b5c3177c5de3b7ca0d08cdcb96fb896 [2024-10-11 22:11:08,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:11:08,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:11:08,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:11:08,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:11:08,524 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:11:08,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:09,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:11:10,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:11:10,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:10,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46cbf59b6/d8eac9705274443fa24e91b4e0bddb44/FLAG92e539c44 [2024-10-11 22:11:10,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46cbf59b6/d8eac9705274443fa24e91b4e0bddb44 [2024-10-11 22:11:10,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:11:10,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:11:10,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:10,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:11:10,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:11:10,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0cacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10, skipping insertion in model container [2024-10-11 22:11:10,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:11:11,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:11,241 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:11:11,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:11,453 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:11:11,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11 WrapperNode [2024-10-11 22:11:11,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:11,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:11,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:11:11,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:11:11,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,520 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-10-11 22:11:11,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:11,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:11:11,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:11:11,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:11:11,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,544 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:11:11,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:11:11,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:11:11,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:11:11,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:11:11,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (1/1) ... [2024-10-11 22:11:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:11,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:11:11,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:11:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:11:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:11:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:11:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:11:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:11:11,845 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:11:11,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:11:11,959 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 22:11:11,959 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:11:11,992 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:11:11,992 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:11:11,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11 BoogieIcfgContainer [2024-10-11 22:11:11,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:11:11,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:11:11,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:11:12,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:11:12,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:11:10" (1/3) ... [2024-10-11 22:11:12,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5d1efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:12, skipping insertion in model container [2024-10-11 22:11:12,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:11" (2/3) ... [2024-10-11 22:11:12,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5d1efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:12, skipping insertion in model container [2024-10-11 22:11:12,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11" (3/3) ... [2024-10-11 22:11:12,004 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:12,021 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:11:12,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:11:12,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:11:12,092 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;@55a78b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:11:12,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:11:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:11:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 22:11:12,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1013506268, now seen corresponding path program 1 times [2024-10-11 22:11:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296127480] [2024-10-11 22:11:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:11:12,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296127480] [2024-10-11 22:11:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296127480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821293985] [2024-10-11 22:11:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:12,426 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,466 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-11 22:11:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 22:11:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,475 INFO L225 Difference]: With dead ends: 30 [2024-10-11 22:11:12,476 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 22:11:12,479 INFO L431 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-10-11 22:11:12,483 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 22:11:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 22:11:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) 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-10-11 22:11:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-11 22:11:12,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2024-10-11 22:11:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,530 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-11 22:11:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-11 22:11:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 22:11:12,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:11:12,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:12,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1013508190, now seen corresponding path program 1 times [2024-10-11 22:11:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604074963] [2024-10-11 22:11:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:11:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604074963] [2024-10-11 22:11:12,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604074963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108926857] [2024-10-11 22:11:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,663 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,679 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 22:11:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-11 22:11:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,680 INFO L225 Difference]: With dead ends: 13 [2024-10-11 22:11:12,680 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 22:11:12,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,682 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 22:11:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 22:11:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-11 22:11:12,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2024-10-11 22:11:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,686 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-11 22:11:12,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-11 22:11:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:11:12,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:11:12,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1353982763, now seen corresponding path program 1 times [2024-10-11 22:11:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008452629] [2024-10-11 22:11:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:11:12,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:11:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:11:12,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 22:11:12,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:11:12,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:11:12,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:11:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:11:12,776 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 22:11:12,801 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:11:12,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:11:12 BoogieIcfgContainer [2024-10-11 22:11:12,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:11:12,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:11:12,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:11:12,809 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:11:12,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11" (3/4) ... [2024-10-11 22:11:12,812 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:11:12,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:11:12,814 INFO L158 Benchmark]: Toolchain (without parser) took 2453.86ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 117.6MB in the beginning and 119.3MB in the end (delta: -1.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,815 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:11:12,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1093.17ms. Allocated memory is still 153.1MB. Free memory was 117.1MB in the beginning and 52.6MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 153.1MB. Free memory was 52.6MB in the beginning and 49.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,817 INFO L158 Benchmark]: Boogie Preprocessor took 40.20ms. Allocated memory is still 153.1MB. Free memory was 49.8MB in the beginning and 47.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,817 INFO L158 Benchmark]: RCFGBuilder took 430.91ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 47.8MB in the beginning and 161.2MB in the end (delta: -113.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,821 INFO L158 Benchmark]: TraceAbstraction took 811.57ms. Allocated memory is still 201.3MB. Free memory was 161.2MB in the beginning and 120.3MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,822 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 201.3MB. Free memory was 120.3MB in the beginning and 119.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:12,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1093.17ms. Allocated memory is still 153.1MB. Free memory was 117.1MB in the beginning and 52.6MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 153.1MB. Free memory was 52.6MB in the beginning and 49.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.20ms. Allocated memory is still 153.1MB. Free memory was 49.8MB in the beginning and 47.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.91ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 47.8MB in the beginning and 161.2MB in the end (delta: -113.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 811.57ms. Allocated memory is still 201.3MB. Free memory was 161.2MB in the beginning and 120.3MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 201.3MB. Free memory was 120.3MB in the beginning and 119.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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); [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_postinc_13_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 GLOBAL_CONST_FIVE==5 [L1556] COND TRUE GLOBAL_CONST_FIVE==5 [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, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 21 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 7, 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.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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-10-11 22:11:12,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c41f1a35be3bdee39c0ea9db71017edc7b5c3177c5de3b7ca0d08cdcb96fb896 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:11:14,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:11:15,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:11:15,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:11:15,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:11:15,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:11:15,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:11:15,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:11:15,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:11:15,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:11:15,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:11:15,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:11:15,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:11:15,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:11:15,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:11:15,091 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:11:15,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:11:15,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:11:15,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:11:15,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:11:15,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:11:15,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:11:15,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:11:15,093 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:11:15,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:11:15,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:11:15,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:11:15,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:11:15,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:11:15,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:11:15,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:11:15,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:11:15,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:11:15,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:11:15,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:15,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:11:15,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:11:15,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:11:15,098 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:11:15,098 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:11:15,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:11:15,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:11:15,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:11:15,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:11:15,100 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:11:15,100 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-clean/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-clean/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 -> c41f1a35be3bdee39c0ea9db71017edc7b5c3177c5de3b7ca0d08cdcb96fb896 [2024-10-11 22:11:15,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:11:15,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:11:15,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:11:15,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:11:15,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:11:15,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:16,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:11:17,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:11:17,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:17,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/89f8716a5/7348df98a57e4681a9c1e85fc5476d43/FLAG1f6983c48 [2024-10-11 22:11:17,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/89f8716a5/7348df98a57e4681a9c1e85fc5476d43 [2024-10-11 22:11:17,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:11:17,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:11:17,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:17,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:11:17,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:11:17,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:17" (1/1) ... [2024-10-11 22:11:17,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19513d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:17, skipping insertion in model container [2024-10-11 22:11:17,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:17" (1/1) ... [2024-10-11 22:11:17,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:11:18,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:18,196 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:11:18,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:18,453 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:11:18,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18 WrapperNode [2024-10-11 22:11:18,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:18,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:18,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:11:18,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:11:18,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,524 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-10-11 22:11:18,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:18,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:11:18,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:11:18,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:11:18,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,560 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:11:18,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:11:18,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:11:18,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:11:18,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:11:18,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (1/1) ... [2024-10-11 22:11:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:18,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:11:18,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:11:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:11:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:11:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:11:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:11:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:11:18,807 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:11:18,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:11:18,919 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 22:11:18,919 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:11:18,966 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:11:18,967 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:11:18,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:18 BoogieIcfgContainer [2024-10-11 22:11:18,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:11:18,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:11:18,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:11:18,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:11:18,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:11:17" (1/3) ... [2024-10-11 22:11:18,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660f82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:18, skipping insertion in model container [2024-10-11 22:11:18,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:18" (2/3) ... [2024-10-11 22:11:18,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660f82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:18, skipping insertion in model container [2024-10-11 22:11:18,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:18" (3/3) ... [2024-10-11 22:11:18,977 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_13_bad.i [2024-10-11 22:11:18,995 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:11:18,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:11:19,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:11:19,067 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;@54846b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:11:19,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:11:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:11:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 22:11:19,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:19,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:19,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1013506268, now seen corresponding path program 1 times [2024-10-11 22:11:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:11:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420382325] [2024-10-11 22:11:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:11:19,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:11:19,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 22:11:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:19,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:11:19,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:11:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:11:19,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:11:19,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:11:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420382325] [2024-10-11 22:11:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420382325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:19,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:11:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326094094] [2024-10-11 22:11:19,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:19,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:11:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:11:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:11:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:11:19,277 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 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 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:19,312 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-11 22:11:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:11:19,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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 10 [2024-10-11 22:11:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:19,319 INFO L225 Difference]: With dead ends: 17 [2024-10-11 22:11:19,319 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 22:11:19,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:11:19,324 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:19,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 22:11:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 22:11:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-10-11 22:11:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-11 22:11:19,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-10-11 22:11:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:19,356 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-11 22:11:19,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-11 22:11:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:11:19,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:19,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:19,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 22:11:19,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:19,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1353923181, now seen corresponding path program 1 times [2024-10-11 22:11:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:11:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518540681] [2024-10-11 22:11:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:11:19,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:11:19,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 22:11:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:19,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:11:19,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:11:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:11:19,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:11:19,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:11:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518540681] [2024-10-11 22:11:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518540681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478306576] [2024-10-11 22:11:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:19,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:11:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:19,653 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:19,665 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-11 22:11:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:11:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:19,667 INFO L225 Difference]: With dead ends: 16 [2024-10-11 22:11:19,667 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 22:11:19,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:19,668 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:19,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 22:11:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 22:11:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-11 22:11:19,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2024-10-11 22:11:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:19,674 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-11 22:11:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:11:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-11 22:11:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:11:19,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:19,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:19,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 22:11:19,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:19,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:11:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1353982763, now seen corresponding path program 1 times [2024-10-11 22:11:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:11:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683578198] [2024-10-11 22:11:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:11:19,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:11:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 22:11:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:11:19,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:11:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:11:19,989 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 22:11:19,989 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:11:19,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:11:19,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:11:19,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 22:11:20,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:11:20,195 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 22:11:20,209 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:11:20,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:11:20 BoogieIcfgContainer [2024-10-11 22:11:20,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:11:20,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:11:20,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:11:20,212 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:11:20,212 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:18" (3/4) ... [2024-10-11 22:11:20,213 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:11:20,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:11:20,215 INFO L158 Benchmark]: Toolchain (without parser) took 2820.62ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.2MB in the beginning and 32.1MB in the end (delta: 8.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,215 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 65.0MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:11:20,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1057.51ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.0MB in the beginning and 61.1MB in the end (delta: -21.1MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.13ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,216 INFO L158 Benchmark]: Boogie Preprocessor took 51.29ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,217 INFO L158 Benchmark]: RCFGBuilder took 389.29ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 40.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,217 INFO L158 Benchmark]: TraceAbstraction took 1241.61ms. Allocated memory is still 90.2MB. Free memory was 40.1MB in the beginning and 32.8MB in the end (delta: 7.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,217 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 90.2MB. Free memory was 32.8MB in the beginning and 32.1MB in the end (delta: 755.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:20,220 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.24ms. Allocated memory is still 65.0MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1057.51ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.0MB in the beginning and 61.1MB in the end (delta: -21.1MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.13ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.29ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.29ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 40.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1241.61ms. Allocated memory is still 90.2MB. Free memory was 40.1MB in the beginning and 32.8MB in the end (delta: 7.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 90.2MB. Free memory was 32.8MB in the beginning and 32.1MB in the end (delta: 755.0kB). 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); [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_postinc_13_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 GLOBAL_CONST_FIVE==5 [L1556] COND TRUE GLOBAL_CONST_FIVE==5 [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, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 28 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 69 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-10-11 22:11:20,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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