./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_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 ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:00:07,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:00:07,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 21:00:07,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:00:07,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:00:07,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:00:07,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:00:07,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:00:07,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:00:07,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:00:07,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:00:07,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:00:07,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:00:07,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:00:07,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:00:07,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:00:07,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:00:07,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:00:07,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:00:07,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:00:07,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:00:07,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:00:07,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:00:07,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:00:07,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:00:07,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:00:07,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:00:07,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:00:07,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:00:07,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:00:07,345 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 -> ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c [2024-11-10 21:00:07,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:00:07,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:00:07,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:00:07,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:00:07,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:00:07,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:08,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:00:09,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:00:09,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:09,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7708fad/3aa84cc1453e4a1daf99ff02a0fe66a1/FLAG2e535c1c1 [2024-11-10 21:00:09,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7708fad/3aa84cc1453e4a1daf99ff02a0fe66a1 [2024-11-10 21:00:09,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:00:09,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:00:09,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:00:09,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:00:09,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:00:09,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:09" (1/1) ... [2024-11-10 21:00:09,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36add341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:09, skipping insertion in model container [2024-11-10 21:00:09,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:09" (1/1) ... [2024-11-10 21:00:09,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:00:09,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:00:09,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:00:10,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:00:10,127 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:00:10,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10 WrapperNode [2024-11-10 21:00:10,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:00:10,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:00:10,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:00:10,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:00:10,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,188 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-10 21:00:10,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:00:10,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:00:10,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:00:10,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:00:10,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,218 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:00:10,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:00:10,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:00:10,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:00:10,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:00:10,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (1/1) ... [2024-11-10 21:00:10,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:00:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:00:10,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 21:00:10,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 21:00:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:00:10,317 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:00:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:00:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:00:10,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:00:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-10 21:00:10,317 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-10 21:00:10,420 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:00:10,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:00:10,550 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-10 21:00:10,551 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:00:10,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:00:10,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:00:10,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:10 BoogieIcfgContainer [2024-11-10 21:00:10,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:00:10,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:00:10,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:00:10,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:00:10,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:00:09" (1/3) ... [2024-11-10 21:00:10,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f08072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:10, skipping insertion in model container [2024-11-10 21:00:10,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:10" (2/3) ... [2024-11-10 21:00:10,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f08072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:10, skipping insertion in model container [2024-11-10 21:00:10,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:10" (3/3) ... [2024-11-10 21:00:10,573 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:10,585 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:00:10,585 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:00:10,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:00:10,639 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;@26dfd2e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:00:10,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:00:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 21:00:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 21:00:10,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:10,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:10,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1967329573, now seen corresponding path program 1 times [2024-11-10 21:00:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:00:10,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450259427] [2024-11-10 21:00:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:00:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:00:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:00:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 21:00:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:00:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:00:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450259427] [2024-11-10 21:00:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450259427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:00:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291109440] [2024-11-10 21:00:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:00:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:00:11,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:00:11,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 21:00:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:00:11,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:00:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:00:11,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:00:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291109440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:00:11,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:00:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 21:00:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564055108] [2024-11-10 21:00:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:00:11,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:00:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:00:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:00:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:00:11,163 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:00:11,194 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-11-10 21:00:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:00:11,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-10 21:00:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:00:11,202 INFO L225 Difference]: With dead ends: 59 [2024-11-10 21:00:11,202 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 21:00:11,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:00:11,207 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:00:11,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:00:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 21:00:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-10 21:00:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 21:00:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-10 21:00:11,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-10 21:00:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:00:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-10 21:00:11,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-10 21:00:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:00:11,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:11,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:11,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 21:00:11,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-10 21:00:11,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 857674600, now seen corresponding path program 1 times [2024-11-10 21:00:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:00:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145891142] [2024-11-10 21:00:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:00:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:00:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:00:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 21:00:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:00:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:00:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145891142] [2024-11-10 21:00:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145891142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:00:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624774682] [2024-11-10 21:00:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:00:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:00:11,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:00:11,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 21:00:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:00:11,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:00:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:00:11,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:00:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624774682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:00:11,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:00:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 21:00:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950457090] [2024-11-10 21:00:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:00:11,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:00:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:00:11,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:00:11,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:00:11,600 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:00:11,646 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-10 21:00:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:00:11,647 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 21:00:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:00:11,648 INFO L225 Difference]: With dead ends: 49 [2024-11-10 21:00:11,648 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 21:00:11,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:00:11,649 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:00:11,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:00:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 21:00:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 21:00:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:00:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-10 21:00:11,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-10 21:00:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:00:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-10 21:00:11,658 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-10 21:00:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 21:00:11,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:11,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:11,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 21:00:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-10 21:00:11,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1457867753, now seen corresponding path program 1 times [2024-11-10 21:00:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:00:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339232537] [2024-11-10 21:00:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:00:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:00:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:00:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 21:00:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:00:11,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:00:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339232537] [2024-11-10 21:00:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339232537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:00:11,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:00:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:00:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125461457] [2024-11-10 21:00:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:00:11,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:00:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:00:11,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:00:11,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:00:11,959 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:00:11,979 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-10 21:00:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:00:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-10 21:00:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:00:11,981 INFO L225 Difference]: With dead ends: 43 [2024-11-10 21:00:11,981 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 21:00:11,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:00:11,983 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:00:11,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:00:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 21:00:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 21:00:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:00:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-10 21:00:11,992 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 27 [2024-11-10 21:00:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:00:11,993 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-10 21:00:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-10 21:00:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 21:00:11,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:11,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:11,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:00:11,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2050739894, now seen corresponding path program 1 times [2024-11-10 21:00:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:00:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883758874] [2024-11-10 21:00:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:00:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:00:12,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:00:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:00:12,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 21:00:12,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:00:12,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:00:12,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:00:12,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:00:12,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 21:00:12,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:00:12,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:00:12 BoogieIcfgContainer [2024-11-10 21:00:12,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:00:12,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:00:12,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:00:12,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:00:12,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:10" (3/4) ... [2024-11-10 21:00:12,114 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:00:12,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:00:12,116 INFO L158 Benchmark]: Toolchain (without parser) took 2942.44ms. Allocated memory is still 234.9MB. Free memory was 161.9MB in the beginning and 168.2MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:12,117 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:12,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 953.57ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 161.7MB in the end (delta: -90.5kB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-11-10 21:00:12,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.52ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 158.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 21:00:12,119 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 234.9MB. Free memory was 158.3MB in the beginning and 155.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:00:12,119 INFO L158 Benchmark]: IcfgBuilder took 333.92ms. Allocated memory is still 234.9MB. Free memory was 155.5MB in the beginning and 137.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 21:00:12,119 INFO L158 Benchmark]: TraceAbstraction took 1540.65ms. Allocated memory is still 234.9MB. Free memory was 136.6MB in the beginning and 168.2MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:12,119 INFO L158 Benchmark]: Witness Printer took 5.81ms. Allocated memory is still 234.9MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:12,121 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 953.57ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 161.7MB in the end (delta: -90.5kB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.52ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 158.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 234.9MB. Free memory was 158.3MB in the beginning and 155.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 333.92ms. Allocated memory is still 234.9MB. Free memory was 155.5MB in the beginning and 137.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1540.65ms. Allocated memory is still 234.9MB. Free memory was 136.6MB in the beginning and 168.2MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.81ms. Allocated memory is still 234.9MB. Free memory is still 168.2MB. 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: 1567]: 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 1575. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1575] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1575] 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] [L1576] CALL CWE190_Integer_Overflow__int_rand_add_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() 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] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] 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] [L1562] 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] [L1562] 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] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() 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] [L1564] COND TRUE staticReturnsTrue() [L1567] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 163 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 21:00:12,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_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 ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:00:14,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:00:14,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 21:00:14,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:00:14,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:00:14,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 21:00:14,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:00:14,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:00:14,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:00:14,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:00:14,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:00:14,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:00:14,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:00:14,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:00:14,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:00:14,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:00:14,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:00:14,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:00:14,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:00:14,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:00:14,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:00:14,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:00:14,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 21:00:14,260 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 21:00:14,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:00:14,261 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:00:14,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 21:00:14,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:00:14,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:00:14,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:00:14,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:00:14,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:00:14,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:00:14,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:00:14,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:00:14,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:00:14,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:00:14,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:00:14,264 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 21:00:14,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 21:00:14,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:00:14,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:00:14,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:00:14,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:00:14,267 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 -> ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c [2024-11-10 21:00:14,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:00:14,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:00:14,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:00:14,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:00:14,584 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:00:14,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:16,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:00:16,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:00:16,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:16,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82da1118e/abd1bead24f041beb1e917d61b95c4d2/FLAG20bdea967 [2024-11-10 21:00:16,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82da1118e/abd1bead24f041beb1e917d61b95c4d2 [2024-11-10 21:00:16,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:00:16,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:00:16,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:00:16,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:00:16,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:00:16,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:16" (1/1) ... [2024-11-10 21:00:16,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f7ed3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:16, skipping insertion in model container [2024-11-10 21:00:16,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:16" (1/1) ... [2024-11-10 21:00:16,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:00:17,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:00:17,237 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:00:17,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:00:17,474 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:00:17,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17 WrapperNode [2024-11-10 21:00:17,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:00:17,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:00:17,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:00:17,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:00:17,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,569 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-10 21:00:17,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:00:17,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:00:17,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:00:17,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:00:17,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,613 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:00:17,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:00:17,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:00:17,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:00:17,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:00:17,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (1/1) ... [2024-11-10 21:00:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:00:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:00:17,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 21:00:17,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 21:00:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:00:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:00:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:00:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:00:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:00:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-10 21:00:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-10 21:00:18,024 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:00:18,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:00:18,236 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 21:00:18,237 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:00:18,246 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:00:18,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:00:18,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:18 BoogieIcfgContainer [2024-11-10 21:00:18,247 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:00:18,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:00:18,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:00:18,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:00:18,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:00:16" (1/3) ... [2024-11-10 21:00:18,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7491441d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:18, skipping insertion in model container [2024-11-10 21:00:18,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:17" (2/3) ... [2024-11-10 21:00:18,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7491441d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:18, skipping insertion in model container [2024-11-10 21:00:18,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:18" (3/3) ... [2024-11-10 21:00:18,257 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-10 21:00:18,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:00:18,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:00:18,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:00:18,331 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;@6a922c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:00:18,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:00:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 21:00:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 21:00:18,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:18,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:18,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:18,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1982519197, now seen corresponding path program 1 times [2024-11-10 21:00:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:00:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655742513] [2024-11-10 21:00:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:18,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:18,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:00:18,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 21:00:18,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 21:00:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:18,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 21:00:18,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:00:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:00:18,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:00:18,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:00:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655742513] [2024-11-10 21:00:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655742513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:00:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:00:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 21:00:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120021843] [2024-11-10 21:00:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:00:18,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:00:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:00:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:00:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:00:18,513 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:00:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:00:18,526 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-10 21:00:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:00:18,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-10 21:00:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:00:18,532 INFO L225 Difference]: With dead ends: 29 [2024-11-10 21:00:18,532 INFO L226 Difference]: Without dead ends: 20 [2024-11-10 21:00:18,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:00:18,537 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:00:18,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:00:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-10 21:00:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 21:00:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:00:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-10 21:00:18,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 19 [2024-11-10 21:00:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:00:18,563 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-10 21:00:18,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:00:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-10 21:00:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 21:00:18,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:18,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:18,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 21:00:18,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:18,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1328552982, now seen corresponding path program 1 times [2024-11-10 21:00:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:00:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649997125] [2024-11-10 21:00:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:18,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:00:18,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 21:00:18,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 21:00:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:00:18,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:00:18,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:00:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:00:18,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:00:18,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:00:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649997125] [2024-11-10 21:00:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649997125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:00:18,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:00:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:00:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776711733] [2024-11-10 21:00:18,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:00:18,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:00:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:00:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:00:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:00:18,874 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:00:18,882 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-10 21:00:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:00:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-10 21:00:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:00:18,883 INFO L225 Difference]: With dead ends: 28 [2024-11-10 21:00:18,883 INFO L226 Difference]: Without dead ends: 20 [2024-11-10 21:00:18,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:00:18,884 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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-11-10 21:00:18,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:00:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-10 21:00:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 21:00:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:00:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 21:00:18,888 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 20 [2024-11-10 21:00:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:00:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 21:00:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:00:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-10 21:00:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:00:18,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:00:18,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:00:18,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 21:00:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:19,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:00:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:00:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -860254068, now seen corresponding path program 1 times [2024-11-10 21:00:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:00:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262379022] [2024-11-10 21:00:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:00:19,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:00:19,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 21:00:19,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 21:00:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:00:19,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:00:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:00:19,270 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 21:00:19,270 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:00:19,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:00:19,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:00:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 21:00:19,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:00:19,479 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 21:00:19,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:00:19,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:00:19 BoogieIcfgContainer [2024-11-10 21:00:19,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:00:19,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:00:19,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:00:19,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:00:19,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:18" (3/4) ... [2024-11-10 21:00:19,542 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:00:19,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:00:19,548 INFO L158 Benchmark]: Toolchain (without parser) took 3041.62ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 65.6MB in the end (delta: -23.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:19,548 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:00:19,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 974.45ms. Allocated memory is still 79.7MB. Free memory was 41.9MB in the beginning and 43.1MB in the end (delta: -1.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.28ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 40.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,549 INFO L158 Benchmark]: Boogie Preprocessor took 86.60ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 37.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,550 INFO L158 Benchmark]: IcfgBuilder took 590.25ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 37.6MB in the beginning and 69.7MB in the end (delta: -32.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,550 INFO L158 Benchmark]: TraceAbstraction took 1285.00ms. Allocated memory is still 100.7MB. Free memory was 68.9MB in the beginning and 66.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,550 INFO L158 Benchmark]: Witness Printer took 8.36ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 65.6MB in the end (delta: 568.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:00:19,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 974.45ms. Allocated memory is still 79.7MB. Free memory was 41.9MB in the beginning and 43.1MB in the end (delta: -1.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.28ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 40.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.60ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 37.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 590.25ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 37.6MB in the beginning and 69.7MB in the end (delta: -32.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1285.00ms. Allocated memory is still 100.7MB. Free memory was 68.9MB in the beginning and 66.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 8.36ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 65.6MB in the end (delta: 568.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1567]: 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 1575. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1575] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1575] 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] [L1576] CALL CWE190_Integer_Overflow__int_rand_add_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() 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] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] 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] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() 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] [L1564] COND TRUE staticReturnsTrue() [L1567] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, 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, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 54 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 21:00:19,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample