./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_rand_preinc_07_bad.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for overflows
Using default analysis
Version 4a390ef5
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_07_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 5b0815b2ad4a616a575c99dd9bb902a9fa411b2463d32e95f50df55219ddf582
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4a390ef-m
[2024-10-24 22:07:08,102 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-24 22:07:08,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf
[2024-10-24 22:07:08,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-24 22:07:08,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-24 22:07:08,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-24 22:07:08,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-24 22:07:08,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-24 22:07:08,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-24 22:07:08,195 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-24 22:07:08,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-24 22:07:08,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-24 22:07:08,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-24 22:07:08,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-24 22:07:08,197 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-24 22:07:08,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-24 22:07:08,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-24 22:07:08,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-24 22:07:08,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-24 22:07:08,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-24 22:07:08,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-24 22:07:08,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-24 22:07:08,200 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-24 22:07:08,200 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-10-24 22:07:08,201 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-24 22:07:08,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-24 22:07:08,202 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-24 22:07:08,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-24 22:07:08,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-24 22:07:08,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-24 22:07:08,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-24 22:07:08,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 22:07:08,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-24 22:07:08,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-24 22:07:08,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-24 22:07:08,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-24 22:07:08,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-24 22:07:08,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-24 22:07:08,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-24 22:07:08,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-24 22:07:08,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-24 22:07:08,210 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 -> 5b0815b2ad4a616a575c99dd9bb902a9fa411b2463d32e95f50df55219ddf582
[2024-10-24 22:07:08,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-24 22:07:08,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-24 22:07:08,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-24 22:07:08,491 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-24 22:07:08,492 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-24 22:07:08,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:09,878 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-24 22:07:10,217 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-24 22:07:10,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:10,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b3229d6/ff3569e9743145bba0ce578e918a7d7f/FLAG12ed2ae31
[2024-10-24 22:07:10,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b3229d6/ff3569e9743145bba0ce578e918a7d7f
[2024-10-24 22:07:10,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-24 22:07:10,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-24 22:07:10,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-24 22:07:10,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-24 22:07:10,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-24 22:07:10,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:10" (1/1) ...
[2024-10-24 22:07:10,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671c9c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:10, skipping insertion in model container
[2024-10-24 22:07:10,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:10" (1/1) ...
[2024-10-24 22:07:10,330 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-24 22:07:11,186 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-24 22:07:11,197 INFO L200 MainTranslator]: Completed pre-run
[2024-10-24 22:07:11,302 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-24 22:07:11,424 INFO L204 MainTranslator]: Completed translation
[2024-10-24 22:07:11,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11 WrapperNode
[2024-10-24 22:07:11,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-24 22:07:11,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-24 22:07:11,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-24 22:07:11,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-24 22:07:11,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,495 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2024-10-24 22:07:11,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-24 22:07:11,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-24 22:07:11,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-24 22:07:11,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-24 22:07:11,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,531 INFO L175 MemorySlicer]: No memory access in input program.
[2024-10-24 22:07:11,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-24 22:07:11,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-24 22:07:11,551 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-24 22:07:11,551 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-24 22:07:11,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (1/1) ...
[2024-10-24 22:07:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 22:07:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 22:07:11,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-24 22:07:11,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-24 22:07:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure printLine
[2024-10-24 22:07:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine
[2024-10-24 22:07:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-24 22:07:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-24 22:07:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-24 22:07:11,810 INFO L238 CfgBuilder]: Building ICFG
[2024-10-24 22:07:11,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-24 22:07:12,052 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live.
[2024-10-24 22:07:12,053 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-24 22:07:12,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-24 22:07:12,080 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-24 22:07:12,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:12 BoogieIcfgContainer
[2024-10-24 22:07:12,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-24 22:07:12,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-24 22:07:12,084 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-24 22:07:12,087 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-24 22:07:12,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:07:10" (1/3) ...
[2024-10-24 22:07:12,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bda8f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:12, skipping insertion in model container
[2024-10-24 22:07:12,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:11" (2/3) ...
[2024-10-24 22:07:12,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bda8f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:12, skipping insertion in model container
[2024-10-24 22:07:12,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:12" (3/3) ...
[2024-10-24 22:07:12,090 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:12,108 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-24 22:07:12,109 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-24 22:07:12,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-24 22:07:12,179 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;@564fada3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-24 22:07:12,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-10-24 22:07:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-10-24 22:07:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-10-24 22:07:12,192 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:12,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:12,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:12,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash -340149182, now seen corresponding path program 1 times
[2024-10-24 22:07:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 22:07:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386442814]
[2024-10-24 22:07:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 22:07:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-24 22:07:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 22:07:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 22:07:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386442814]
[2024-10-24 22:07:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386442814] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 22:07:12,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 22:07:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 22:07:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936079181]
[2024-10-24 22:07:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 22:07:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 22:07:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 22:07:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 22:07:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 22:07:12,516 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 22:07:12,579 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions.
[2024-10-24 22:07:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-24 22:07:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10
[2024-10-24 22:07:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 22:07:12,588 INFO L225 Difference]: With dead ends: 52
[2024-10-24 22:07:12,588 INFO L226 Difference]: Without dead ends: 35
[2024-10-24 22:07:12,591 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-24 22:07:12,595 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 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-24 22:07:12,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 22:07:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2024-10-24 22:07:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2024-10-24 22:07:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions.
[2024-10-24 22:07:12,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 10
[2024-10-24 22:07:12,636 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-24 22:07:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions.
[2024-10-24 22:07:12,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions.
[2024-10-24 22:07:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-10-24 22:07:12,637 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:12,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:12,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-24 22:07:12,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1144257505, now seen corresponding path program 1 times
[2024-10-24 22:07:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 22:07:12,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459378644]
[2024-10-24 22:07:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 22:07:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-24 22:07:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 22:07:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 22:07:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459378644]
[2024-10-24 22:07:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459378644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 22:07:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 22:07:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-24 22:07:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054589590]
[2024-10-24 22:07:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 22:07:12,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 22:07:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 22:07:12,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 22:07:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 22:07:12,871 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 22:07:12,888 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions.
[2024-10-24 22:07:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-24 22:07:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16
[2024-10-24 22:07:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 22:07:12,890 INFO L225 Difference]: With dead ends: 35
[2024-10-24 22:07:12,890 INFO L226 Difference]: Without dead ends: 34
[2024-10-24 22:07:12,890 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-24 22:07:12,891 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 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-24 22:07:12,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 22:07:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2024-10-24 22:07:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2024-10-24 22:07:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions.
[2024-10-24 22:07:12,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16
[2024-10-24 22:07:12,902 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-24 22:07:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions.
[2024-10-24 22:07:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions.
[2024-10-24 22:07:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-10-24 22:07:12,904 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:12,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:12,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-24 22:07:12,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:12,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1112244153, now seen corresponding path program 1 times
[2024-10-24 22:07:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 22:07:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544975456]
[2024-10-24 22:07:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 22:07:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-24 22:07:12,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-24 22:07:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-24 22:07:12,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-24 22:07:12,971 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-24 22:07:12,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining)
[2024-10-24 22:07:12,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining)
[2024-10-24 22:07:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-24 22:07:12,977 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-10-24 22:07:12,999 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-24 22:07:13,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:07:13 BoogieIcfgContainer
[2024-10-24 22:07:13,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-24 22:07:13,004 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-24 22:07:13,004 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-24 22:07:13,004 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-24 22:07:13,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:12" (3/4) ...
[2024-10-24 22:07:13,007 INFO L142 WitnessPrinter]: No result that supports witness generation found
[2024-10-24 22:07:13,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-24 22:07:13,009 INFO L158 Benchmark]: Toolchain (without parser) took 2746.14ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 71.9MB in the beginning and 133.8MB in the end (delta: -61.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:13,010 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:13,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1161.25ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 71.8MB in the beginning and 122.9MB in the end (delta: -51.1MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB.
[2024-10-24 22:07:13,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.00ms. Allocated memory is still 199.2MB. Free memory was 122.9MB in the beginning and 119.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-24 22:07:13,013 INFO L158 Benchmark]: Boogie Preprocessor took 53.07ms. Allocated memory is still 199.2MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-24 22:07:13,014 INFO L158 Benchmark]: RCFGBuilder took 529.52ms. Allocated memory is still 199.2MB. Free memory was 117.7MB in the beginning and 99.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-10-24 22:07:13,014 INFO L158 Benchmark]: TraceAbstraction took 919.87ms. Allocated memory is still 199.2MB. Free memory was 98.8MB in the beginning and 133.8MB in the end (delta: -35.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:13,014 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 199.2MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:13,017 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.20ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1161.25ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 71.8MB in the beginning and 122.9MB in the end (delta: -51.1MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 69.00ms. Allocated memory is still 199.2MB. Free memory was 122.9MB in the beginning and 119.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 53.07ms. Allocated memory is still 199.2MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 529.52ms. Allocated memory is still 199.2MB. Free memory was 117.7MB in the beginning and 99.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 919.87ms. Allocated memory is still 199.2MB. Free memory was 98.8MB in the beginning and 133.8MB in the end (delta: -35.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 4.16ms. Allocated memory is still 199.2MB. Free memory is still 133.8MB. 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 1569.
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);
[L1548] static int staticFive = 5;
[L1569] 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, staticFive=5]
[L1414] COND TRUE line != ((void *)0)
[L1569] 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, staticFive=5]
[L1570] CALL CWE190_Integer_Overflow__int_rand_preinc_07_bad()
[L1551] int data;
[L1552] 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, staticFive=5]
[L1553] COND TRUE staticFive==5
[L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1
[L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15)
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, staticFive=5]
[L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()
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, staticFive=5]
[L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1
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, staticFive=5]
[L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1))
[L1557] COND TRUE staticFive==5
VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5]
[L1560] ++data
VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5]
- 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, 39 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 92 mSDtfsCounter, 10 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=39occurred 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.3s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 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-24 22:07:13,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/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_rand_preinc_07_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 5b0815b2ad4a616a575c99dd9bb902a9fa411b2463d32e95f50df55219ddf582
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4a390ef-m
[2024-10-24 22:07:15,179 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-24 22:07:15,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf
[2024-10-24 22:07:15,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-24 22:07:15,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-24 22:07:15,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2024-10-24 22:07:15,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-24 22:07:15,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-24 22:07:15,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-24 22:07:15,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-24 22:07:15,271 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-24 22:07:15,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-24 22:07:15,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-24 22:07:15,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-24 22:07:15,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-24 22:07:15,273 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-24 22:07:15,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-24 22:07:15,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-24 22:07:15,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-24 22:07:15,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-24 22:07:15,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-24 22:07:15,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-24 22:07:15,280 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-10-24 22:07:15,280 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-10-24 22:07:15,280 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-24 22:07:15,280 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-10-24 22:07:15,281 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-10-24 22:07:15,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-24 22:07:15,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-24 22:07:15,281 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-24 22:07:15,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-24 22:07:15,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-24 22:07:15,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-24 22:07:15,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-24 22:07:15,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 22:07:15,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-24 22:07:15,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-24 22:07:15,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-24 22:07:15,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-10-24 22:07:15,288 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-10-24 22:07:15,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-24 22:07:15,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-24 22:07:15,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-24 22:07:15,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-24 22:07:15,289 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2024-10-24 22:07:15,289 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 -> 5b0815b2ad4a616a575c99dd9bb902a9fa411b2463d32e95f50df55219ddf582
[2024-10-24 22:07:15,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-24 22:07:15,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-24 22:07:15,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-24 22:07:15,634 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-24 22:07:15,635 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-24 22:07:15,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:17,174 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-24 22:07:17,518 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-24 22:07:17,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:17,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf069ae5/b25b1729b0014ecdab7adb4799050cd4/FLAGa07905214
[2024-10-24 22:07:17,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf069ae5/b25b1729b0014ecdab7adb4799050cd4
[2024-10-24 22:07:17,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-24 22:07:17,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-24 22:07:17,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-24 22:07:17,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-24 22:07:17,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-24 22:07:17,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:17" (1/1) ...
[2024-10-24 22:07:17,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2575a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:17, skipping insertion in model container
[2024-10-24 22:07:17,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:17" (1/1) ...
[2024-10-24 22:07:17,629 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-24 22:07:18,465 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-24 22:07:18,480 INFO L200 MainTranslator]: Completed pre-run
[2024-10-24 22:07:18,586 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-24 22:07:18,735 INFO L204 MainTranslator]: Completed translation
[2024-10-24 22:07:18,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18 WrapperNode
[2024-10-24 22:07:18,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-24 22:07:18,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-24 22:07:18,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-24 22:07:18,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-24 22:07:18,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,816 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62
[2024-10-24 22:07:18,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-24 22:07:18,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-24 22:07:18,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-24 22:07:18,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-24 22:07:18,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,848 INFO L175 MemorySlicer]: No memory access in input program.
[2024-10-24 22:07:18,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-24 22:07:18,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-24 22:07:18,881 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-24 22:07:18,881 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-24 22:07:18,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (1/1) ...
[2024-10-24 22:07:18,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 22:07:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 22:07:18,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-24 22:07:18,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-24 22:07:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure printLine
[2024-10-24 22:07:18,975 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine
[2024-10-24 22:07:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-24 22:07:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-24 22:07:18,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-24 22:07:19,145 INFO L238 CfgBuilder]: Building ICFG
[2024-10-24 22:07:19,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-24 22:07:19,287 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2024-10-24 22:07:19,291 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-24 22:07:19,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-24 22:07:19,327 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-24 22:07:19,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:19 BoogieIcfgContainer
[2024-10-24 22:07:19,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-24 22:07:19,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-24 22:07:19,333 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-24 22:07:19,337 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-24 22:07:19,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:07:17" (1/3) ...
[2024-10-24 22:07:19,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24691e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:19, skipping insertion in model container
[2024-10-24 22:07:19,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:18" (2/3) ...
[2024-10-24 22:07:19,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24691e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:19, skipping insertion in model container
[2024-10-24 22:07:19,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:19" (3/3) ...
[2024-10-24 22:07:19,341 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_07_bad.i
[2024-10-24 22:07:19,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-24 22:07:19,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-24 22:07:19,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-24 22:07:19,423 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;@6dbe984e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-24 22:07:19,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-10-24 22:07:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-10-24 22:07:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-10-24 22:07:19,433 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:19,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:19,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2145058738, now seen corresponding path program 1 times
[2024-10-24 22:07:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-24 22:07:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076704908]
[2024-10-24 22:07:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-24 22:07:19,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-24 22:07:19,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-10-24 22:07:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:19,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-10-24 22:07:19,583 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 22:07:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 22:07:19,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-24 22:07:19,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-24 22:07:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076704908]
[2024-10-24 22:07:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076704908] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 22:07:19,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 22:07:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-10-24 22:07:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384803695]
[2024-10-24 22:07:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 22:07:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-24 22:07:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-24 22:07:19,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-24 22:07:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-24 22:07:19,638 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 22:07:19,661 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions.
[2024-10-24 22:07:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-24 22:07:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10
[2024-10-24 22:07:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 22:07:19,671 INFO L225 Difference]: With dead ends: 19
[2024-10-24 22:07:19,671 INFO L226 Difference]: Without dead ends: 14
[2024-10-24 22:07:19,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-24 22:07:19,677 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 22:07:19,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 22:07:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2024-10-24 22:07:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2024-10-24 22:07:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions.
[2024-10-24 22:07:19,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10
[2024-10-24 22:07:19,714 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-24 22:07:19,715 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions.
[2024-10-24 22:07:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions.
[2024-10-24 22:07:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-10-24 22:07:19,715 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:19,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:19,722 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-24 22:07:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:19,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2072311500, now seen corresponding path program 1 times
[2024-10-24 22:07:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-24 22:07:19,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777345429]
[2024-10-24 22:07:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-24 22:07:19,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-24 22:07:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-10-24 22:07:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 22:07:20,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-24 22:07:20,011 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 22:07:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 22:07:20,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-24 22:07:20,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-24 22:07:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777345429]
[2024-10-24 22:07:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777345429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 22:07:20,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 22:07:20,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 22:07:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299687580]
[2024-10-24 22:07:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 22:07:20,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 22:07:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-24 22:07:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 22:07:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 22:07:20,034 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 22:07:20,045 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions.
[2024-10-24 22:07:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-24 22:07:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2024-10-24 22:07:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 22:07:20,046 INFO L225 Difference]: With dead ends: 18
[2024-10-24 22:07:20,047 INFO L226 Difference]: Without dead ends: 14
[2024-10-24 22:07:20,047 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-24 22:07:20,049 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 22:07:20,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 22:07:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2024-10-24 22:07:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2024-10-24 22:07:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2024-10-24 22:07:20,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11
[2024-10-24 22:07:20,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-24 22:07:20,057 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions.
[2024-10-24 22:07:20,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-24 22:07:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions.
[2024-10-24 22:07:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-10-24 22:07:20,057 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-24 22:07:20,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 22:07:20,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-10-24 22:07:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:20,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] ===
[2024-10-24 22:07:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 22:07:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1640611663, now seen corresponding path program 1 times
[2024-10-24 22:07:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-24 22:07:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290138044]
[2024-10-24 22:07:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 22:07:20,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-24 22:07:20,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-24 22:07:20,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-10-24 22:07:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-24 22:07:20,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-24 22:07:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-24 22:07:20,381 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-10-24 22:07:20,381 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-24 22:07:20,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining)
[2024-10-24 22:07:20,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining)
[2024-10-24 22:07:20,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-10-24 22:07:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-24 22:07:20,589 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-10-24 22:07:20,617 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-24 22:07:20,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:07:20 BoogieIcfgContainer
[2024-10-24 22:07:20,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-24 22:07:20,624 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-24 22:07:20,625 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-24 22:07:20,625 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-24 22:07:20,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:19" (3/4) ...
[2024-10-24 22:07:20,628 INFO L142 WitnessPrinter]: No result that supports witness generation found
[2024-10-24 22:07:20,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-24 22:07:20,630 INFO L158 Benchmark]: Toolchain (without parser) took 3063.65ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 39.2MB in the beginning and 40.4MB in the end (delta: -1.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,630 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:20,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1167.30ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 39.0MB in the beginning and 47.7MB in the end (delta: -8.8MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.71ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 44.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,633 INFO L158 Benchmark]: Boogie Preprocessor took 62.38ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,635 INFO L158 Benchmark]: RCFGBuilder took 451.38ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 51.4MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,635 INFO L158 Benchmark]: TraceAbstraction took 1290.58ms. Allocated memory is still 83.9MB. Free memory was 50.9MB in the beginning and 40.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB.
[2024-10-24 22:07:20,636 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 40.4MB in the end (delta: 497.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-24 22:07:20,638 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.53ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1167.30ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 39.0MB in the beginning and 47.7MB in the end (delta: -8.8MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 79.71ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 44.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 62.38ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 451.38ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 51.4MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 1290.58ms. Allocated memory is still 83.9MB. Free memory was 50.9MB in the beginning and 40.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB.
* Witness Printer took 4.71ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 40.4MB in the end (delta: 497.3kB). 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 1569.
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);
[L1548] static int staticFive = 5;
[L1569] 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, staticFive=5]
[L1414] COND TRUE line != ((void *)0)
[L1569] 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, staticFive=5]
[L1570] CALL CWE190_Integer_Overflow__int_rand_preinc_07_bad()
[L1551] int data;
[L1552] 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, staticFive=5]
[L1553] COND TRUE staticFive==5
[L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1
[L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1
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, staticFive=5]
[L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1))
[L1557] COND TRUE staticFive==5
VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5]
[L1560] ++data
VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5]
- 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, 19 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-10-24 22:07:20,713 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