./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_multiply_13_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8b1340768e928b3ffe92bcb39266a48a482b155422b2f95d8c0931683791d213 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:54:59,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:54:59,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:54:59,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:54:59,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:54:59,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:54:59,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:54:59,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:54:59,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:54:59,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:54:59,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:54:59,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:54:59,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:54:59,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:54:59,298 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:54:59,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:54:59,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:54:59,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:54:59,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:54:59,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:54:59,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:54:59,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:54:59,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:54:59,301 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:54:59,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:54:59,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:54:59,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:54:59,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:54:59,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:54:59,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:54:59,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:54:59,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:54:59,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:54:59,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:54:59,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:54:59,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:54:59,305 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b1340768e928b3ffe92bcb39266a48a482b155422b2f95d8c0931683791d213 [2024-10-13 14:54:59,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:54:59,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:54:59,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:54:59,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:54:59,528 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:54:59,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:00,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:55:01,011 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:55:01,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:01,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea0495c9/5f9b82c053024c52a52646d17dc4e367/FLAGd67c7a7e8 [2024-10-13 14:55:01,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea0495c9/5f9b82c053024c52a52646d17dc4e367 [2024-10-13 14:55:01,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:55:01,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:55:01,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:55:01,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:55:01,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:55:01,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:01" (1/1) ... [2024-10-13 14:55:01,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b3eee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:01, skipping insertion in model container [2024-10-13 14:55:01,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:01" (1/1) ... [2024-10-13 14:55:01,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:55:01,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:55:01,949 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:55:02,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:55:02,146 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:55:02,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02 WrapperNode [2024-10-13 14:55:02,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:55:02,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:55:02,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:55:02,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:55:02,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,194 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-13 14:55:02,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:55:02,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:55:02,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:55:02,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:55:02,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,216 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:55:02,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:55:02,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:55:02,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:55:02,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:55:02,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (1/1) ... [2024-10-13 14:55:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:55:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:55:02,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:55:02,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:55:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:55:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:55:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:55:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:55:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:55:02,387 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:55:02,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:55:02,452 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 14:55:02,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:55:02,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:55:02,475 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:55:02,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:02 BoogieIcfgContainer [2024-10-13 14:55:02,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:55:02,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:55:02,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:55:02,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:55:02,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:55:01" (1/3) ... [2024-10-13 14:55:02,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea2ecbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:02, skipping insertion in model container [2024-10-13 14:55:02,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:02" (2/3) ... [2024-10-13 14:55:02,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea2ecbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:02, skipping insertion in model container [2024-10-13 14:55:02,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:02" (3/3) ... [2024-10-13 14:55:02,484 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:02,496 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:55:02,496 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 14:55:02,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:55:02,541 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;@1ade60d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:55:02,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 14:55:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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-13 14:55:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:55:02,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:02,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:02,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -258035539, now seen corresponding path program 1 times [2024-10-13 14:55:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:55:02,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279932901] [2024-10-13 14:55:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:55:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:55:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:02,797 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-13 14:55:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:55:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279932901] [2024-10-13 14:55:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279932901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:55:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:55:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:55:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189848771] [2024-10-13 14:55:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:55:02,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:55:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:55:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:55:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:55:02,830 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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 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-13 14:55:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:55:02,863 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-10-13 14:55:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:55:02,866 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-13 14:55:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:55:02,871 INFO L225 Difference]: With dead ends: 32 [2024-10-13 14:55:02,871 INFO L226 Difference]: Without dead ends: 14 [2024-10-13 14:55:02,873 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-13 14:55:02,877 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 15 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-13 14:55:02,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:55:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-13 14:55:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 14:55:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-13 14:55:02,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-10-13 14:55:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:55:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-13 14:55:02,905 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-13 14:55:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-13 14:55:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:55:02,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:02,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:02,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:55:02,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:02,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -258095121, now seen corresponding path program 1 times [2024-10-13 14:55:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:55:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136167659] [2024-10-13 14:55:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:55:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:55:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:02,997 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-13 14:55:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:55:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136167659] [2024-10-13 14:55:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136167659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:55:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:55:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:55:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243870817] [2024-10-13 14:55:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:55:03,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:55:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:55:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:55:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:55:03,002 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:55:03,016 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-13 14:55:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:55:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 14:55:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:55:03,018 INFO L225 Difference]: With dead ends: 14 [2024-10-13 14:55:03,018 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 14:55:03,019 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-13 14:55:03,020 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:55:03,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:55:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 14:55:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 14:55:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-13 14:55:03,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-10-13 14:55:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:55:03,025 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-13 14:55:03,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-13 14:55:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 14:55:03,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:03,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:03,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 14:55:03,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:03,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 588985899, now seen corresponding path program 1 times [2024-10-13 14:55:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:55:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736239775] [2024-10-13 14:55:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:55:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:55:03,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 14:55:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:55:03,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 14:55:03,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 14:55:03,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-13 14:55:03,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-13 14:55:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:55:03,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 14:55:03,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:55:03,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:55:03 BoogieIcfgContainer [2024-10-13 14:55:03,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:55:03,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:55:03,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:55:03,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:55:03,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:02" (3/4) ... [2024-10-13 14:55:03,122 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 14:55:03,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:55:03,125 INFO L158 Benchmark]: Toolchain (without parser) took 1798.30ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 110.5MB in the beginning and 123.3MB in the end (delta: -12.7MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,125 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:55:03,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 820.15ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 110.5MB in the beginning and 180.9MB in the end (delta: -70.4MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.52ms. Allocated memory is still 239.1MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,129 INFO L158 Benchmark]: Boogie Preprocessor took 30.94ms. Allocated memory is still 239.1MB. Free memory was 178.9MB in the beginning and 176.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,129 INFO L158 Benchmark]: RCFGBuilder took 248.64ms. Allocated memory is still 239.1MB. Free memory was 176.8MB in the beginning and 163.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,129 INFO L158 Benchmark]: TraceAbstraction took 642.78ms. Allocated memory is still 239.1MB. Free memory was 162.1MB in the beginning and 123.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,129 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 239.1MB. Free memory was 123.3MB in the beginning and 123.3MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:55:03,131 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 820.15ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 110.5MB in the beginning and 180.9MB in the end (delta: -70.4MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.52ms. Allocated memory is still 239.1MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.94ms. Allocated memory is still 239.1MB. Free memory was 178.9MB in the beginning and 176.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.64ms. Allocated memory is still 239.1MB. Free memory was 176.8MB in the beginning and 163.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 642.78ms. Allocated memory is still 239.1MB. Free memory was 162.1MB in the beginning and 123.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 239.1MB. Free memory was 123.3MB in the beginning and 123.3MB in the end (delta: 2.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: 1560]: 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_multiply_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 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: 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, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 25 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 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-13 14:55:03,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8b1340768e928b3ffe92bcb39266a48a482b155422b2f95d8c0931683791d213 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:55:04,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:55:05,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 14:55:05,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:55:05,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:55:05,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 14:55:05,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:55:05,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:55:05,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:55:05,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:55:05,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:55:05,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:55:05,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:55:05,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:55:05,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:55:05,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:55:05,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:55:05,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:55:05,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:55:05,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:55:05,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:55:05,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:55:05,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 14:55:05,056 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:55:05,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:55:05,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:55:05,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:55:05,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:55:05,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:55:05,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:55:05,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:55:05,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:55:05,063 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 14:55:05,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 14:55:05,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:55:05,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:55:05,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:55:05,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:55:05,064 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 14:55:05,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b1340768e928b3ffe92bcb39266a48a482b155422b2f95d8c0931683791d213 [2024-10-13 14:55:05,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:55:05,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:55:05,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:55:05,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:55:05,360 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:55:05,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:06,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:55:06,802 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:55:06,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:06,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa8940b6/b515a8fbe6cb4397b77e00fa1ca30590/FLAGcc050fc21 [2024-10-13 14:55:06,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa8940b6/b515a8fbe6cb4397b77e00fa1ca30590 [2024-10-13 14:55:06,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:55:06,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:55:06,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:55:06,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:55:06,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:55:06,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:06" (1/1) ... [2024-10-13 14:55:06,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132597dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:06, skipping insertion in model container [2024-10-13 14:55:06,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:06" (1/1) ... [2024-10-13 14:55:06,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:55:07,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:55:07,490 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:55:07,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:55:07,650 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:55:07,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07 WrapperNode [2024-10-13 14:55:07,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:55:07,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:55:07,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:55:07,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:55:07,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,698 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2024-10-13 14:55:07,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:55:07,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:55:07,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:55:07,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:55:07,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,714 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:55:07,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:55:07,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:55:07,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:55:07,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:55:07,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (1/1) ... [2024-10-13 14:55:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:55:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:55:07,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:55:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:55:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:55:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:55:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:55:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:55:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:55:07,914 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:55:07,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:55:08,007 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 14:55:08,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:55:08,039 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:55:08,040 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:55:08,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:08 BoogieIcfgContainer [2024-10-13 14:55:08,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:55:08,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:55:08,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:55:08,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:55:08,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:55:06" (1/3) ... [2024-10-13 14:55:08,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:08, skipping insertion in model container [2024-10-13 14:55:08,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:07" (2/3) ... [2024-10-13 14:55:08,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:08, skipping insertion in model container [2024-10-13 14:55:08,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:08" (3/3) ... [2024-10-13 14:55:08,061 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_13_bad.i [2024-10-13 14:55:08,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:55:08,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 14:55:08,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:55:08,131 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;@6c3a9a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:55:08,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 14:55:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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-13 14:55:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:55:08,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:08,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:08,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:08,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash -258035539, now seen corresponding path program 1 times [2024-10-13 14:55:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:55:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256289555] [2024-10-13 14:55:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:08,158 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-13 14:55:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:55:08,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:55:08,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 14:55:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:08,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 14:55:08,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:55:08,253 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-13 14:55:08,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 14:55:08,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 14:55:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256289555] [2024-10-13 14:55:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256289555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:55:08,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:55:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:55:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611075350] [2024-10-13 14:55:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:55:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:55:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 14:55:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:55:08,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:55:08,280 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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 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-13 14:55:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:55:08,316 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-10-13 14:55:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:55:08,317 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-13 14:55:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:55:08,322 INFO L225 Difference]: With dead ends: 40 [2024-10-13 14:55:08,322 INFO L226 Difference]: Without dead ends: 14 [2024-10-13 14:55:08,325 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-13 14:55:08,328 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:55:08,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:55:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-13 14:55:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 14:55:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-13 14:55:08,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-10-13 14:55:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:55:08,356 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-13 14:55:08,356 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-13 14:55:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-13 14:55:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:55:08,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:08,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:08,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 14:55:08,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:55:08,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -258095121, now seen corresponding path program 1 times [2024-10-13 14:55:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:55:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658009404] [2024-10-13 14:55:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:08,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-13 14:55:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:55:08,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:55:08,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 14:55:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:55:08,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 14:55:08,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:55:08,652 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-13 14:55:08,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 14:55:08,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 14:55:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658009404] [2024-10-13 14:55:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658009404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:55:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:55:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:55:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951976303] [2024-10-13 14:55:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:55:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:55:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 14:55:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:55:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:55:08,657 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:55:08,674 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-13 14:55:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:55:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 14:55:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:55:08,675 INFO L225 Difference]: With dead ends: 14 [2024-10-13 14:55:08,675 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 14:55:08,675 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-13 14:55:08,676 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:55:08,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:55:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 14:55:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 14:55:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-13 14:55:08,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-10-13 14:55:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:55:08,681 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-13 14:55:08,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:55:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-13 14:55:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 14:55:08,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:55:08,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:55:08,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 14:55:08,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:55:08,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 14:55:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:55:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 588985899, now seen corresponding path program 1 times [2024-10-13 14:55:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:55:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986915089] [2024-10-13 14:55:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:55:08,889 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-13 14:55:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:55:08,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:55:08,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 14:55:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:55:08,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 14:55:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:55:08,982 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 14:55:08,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 14:55:08,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-13 14:55:08,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-13 14:55:08,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 14:55:09,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:55:09,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 14:55:09,211 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:55:09,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:55:09 BoogieIcfgContainer [2024-10-13 14:55:09,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:55:09,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:55:09,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:55:09,217 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:55:09,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:08" (3/4) ... [2024-10-13 14:55:09,219 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 14:55:09,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:55:09,221 INFO L158 Benchmark]: Toolchain (without parser) took 2378.83ms. Allocated memory was 62.9MB in the beginning and 107.0MB in the end (delta: 44.0MB). Free memory was 39.6MB in the beginning and 66.6MB in the end (delta: -26.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,221 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:55:09,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.41ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 39.4MB in the beginning and 50.9MB in the end (delta: -11.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.80ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 48.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,222 INFO L158 Benchmark]: Boogie Preprocessor took 29.92ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,222 INFO L158 Benchmark]: RCFGBuilder took 311.34ms. Allocated memory is still 81.8MB. Free memory was 45.4MB in the beginning and 30.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,223 INFO L158 Benchmark]: TraceAbstraction took 1162.09ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 53.7MB in the beginning and 67.3MB in the end (delta: -13.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-13 14:55:09,223 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 107.0MB. Free memory was 67.3MB in the beginning and 66.6MB in the end (delta: 691.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:55:09,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.41ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 39.4MB in the beginning and 50.9MB in the end (delta: -11.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.80ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 48.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.92ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.34ms. Allocated memory is still 81.8MB. Free memory was 45.4MB in the beginning and 30.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1162.09ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 53.7MB in the beginning and 67.3MB in the end (delta: -13.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 107.0MB. Free memory was 67.3MB in the beginning and 66.6MB in the end (delta: 691.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: 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_multiply_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 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: 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, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 32 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 4 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-13 14:55:09,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample