./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_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 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:29:16,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:29:16,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 22:29:16,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:29:16,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:29:16,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:29:16,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:29:16,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:29:16,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:29:16,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:29:16,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:29:16,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:29:16,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:29:16,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:29:16,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:29:16,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:29:16,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:29:16,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 22:29:16,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:29:16,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:29:16,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:29:16,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:29:16,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:29:16,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:29:16,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:29:16,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:29:16,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:29:16,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:29:16,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:29:16,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:29:16,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:29:16,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:29:16,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:29:16,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:29:16,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:29:16,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 22:29:16,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 22:29:16,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:29:16,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:29:16,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:29:16,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:29:16,390 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 -> 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed [2024-10-14 22:29:16,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:29:16,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:29:16,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:29:16,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:29:16,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:29:16,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:18,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:29:18,486 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:29:18,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:18,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219fac935/99bd2099abd04ff99db9c0048551cc61/FLAG135868bf3 [2024-10-14 22:29:18,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219fac935/99bd2099abd04ff99db9c0048551cc61 [2024-10-14 22:29:18,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:29:18,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:29:18,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:29:18,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:29:18,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:29:18,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:29:18" (1/1) ... [2024-10-14 22:29:18,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328ec32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:18, skipping insertion in model container [2024-10-14 22:29:18,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:29:18" (1/1) ... [2024-10-14 22:29:18,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:29:19,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:29:19,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:29:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:29:19,482 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:29:19,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19 WrapperNode [2024-10-14 22:29:19,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:29:19,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:29:19,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:29:19,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:29:19,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,530 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2024-10-14 22:29:19,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:29:19,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:29:19,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:29:19,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:29:19,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,558 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:29:19,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:29:19,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:29:19,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:29:19,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:29:19,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (1/1) ... [2024-10-14 22:29:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:29:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:29:19,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 22:29:19,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 22:29:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:29:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:29:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:29:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:29:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:29:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-14 22:29:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-14 22:29:19,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:29:19,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:29:20,004 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-14 22:29:20,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:29:20,044 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:29:20,045 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:29:20,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:20 BoogieIcfgContainer [2024-10-14 22:29:20,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:29:20,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:29:20,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:29:20,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:29:20,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:29:18" (1/3) ... [2024-10-14 22:29:20,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fde4e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:29:20, skipping insertion in model container [2024-10-14 22:29:20,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:19" (2/3) ... [2024-10-14 22:29:20,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fde4e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:29:20, skipping insertion in model container [2024-10-14 22:29:20,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:20" (3/3) ... [2024-10-14 22:29:20,056 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:20,071 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:29:20,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:29:20,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:29:20,142 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;@7fed3151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:29:20,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:29:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 39 states have internal predecessors, (56), 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-10-14 22:29:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:29:20,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:20,155 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:29:20,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1755248653, now seen corresponding path program 1 times [2024-10-14 22:29:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:29:20,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829402517] [2024-10-14 22:29:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:29:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:29:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:29:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 22:29:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 22:29:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:29:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829402517] [2024-10-14 22:29:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829402517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 22:29:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102474993] [2024-10-14 22:29:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 22:29:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:29:20,534 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-10-14 22:29:20,535 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-10-14 22:29:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:20,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 22:29:20,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:29:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:29:20,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:29:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102474993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:29:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 22:29:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-14 22:29:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078475508] [2024-10-14 22:29:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:29:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:29:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:29:20,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:29:20,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 22:29:20,725 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 39 states have internal predecessors, (56), 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, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 22:29:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:29:20,762 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2024-10-14 22:29:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:29:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19 [2024-10-14 22:29:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:29:20,772 INFO L225 Difference]: With dead ends: 63 [2024-10-14 22:29:20,772 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 22:29:20,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-10-14 22:29:20,777 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:29:20,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:29:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 22:29:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 22:29:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.4285714285714286) 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-10-14 22:29:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-10-14 22:29:20,814 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 19 [2024-10-14 22:29:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:29:20,815 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-10-14 22:29:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 22:29:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-10-14 22:29:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 22:29:20,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:20,819 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 22:29:20,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 22:29:21,024 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-10-14 22:29:21,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2064849968, now seen corresponding path program 1 times [2024-10-14 22:29:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:29:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943040980] [2024-10-14 22:29:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:29:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:29:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:29:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:29:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:29:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:29:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943040980] [2024-10-14 22:29:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943040980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:29:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:29:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:29:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346931421] [2024-10-14 22:29:21,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:29:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:29:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:29:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:29:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:29:21,121 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 22:29:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:29:21,143 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-10-14 22:29:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:29:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2024-10-14 22:29:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:29:21,145 INFO L225 Difference]: With dead ends: 42 [2024-10-14 22:29:21,146 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 22:29:21,146 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-10-14 22:29:21,147 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 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-10-14 22:29:21,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:29:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 22:29:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 22:29:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 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-10-14 22:29:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-14 22:29:21,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 25 [2024-10-14 22:29:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:29:21,158 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-14 22:29:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 22:29:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-14 22:29:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 22:29:21,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:21,159 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 22:29:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 22:29:21,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 414160573, now seen corresponding path program 1 times [2024-10-14 22:29:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:29:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309417258] [2024-10-14 22:29:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:29:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:29:21,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:29:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:29:21,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 22:29:21,241 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:29:21,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:29:21,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:29:21,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 22:29:21,249 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 22:29:21,289 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:29:21,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:29:21 BoogieIcfgContainer [2024-10-14 22:29:21,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:29:21,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:29:21,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:29:21,298 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:29:21,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:20" (3/4) ... [2024-10-14 22:29:21,301 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:29:21,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:29:21,302 INFO L158 Benchmark]: Toolchain (without parser) took 2763.04ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 57.6MB in the end (delta: 69.2MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,303 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:29:21,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 941.30ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 63.8MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.27ms. Allocated memory is still 159.4MB. Free memory was 63.8MB in the beginning and 60.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,305 INFO L158 Benchmark]: Boogie Preprocessor took 40.62ms. Allocated memory is still 159.4MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,305 INFO L158 Benchmark]: RCFGBuilder took 476.80ms. Allocated memory is still 159.4MB. Free memory was 58.3MB in the beginning and 120.5MB in the end (delta: -62.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,305 INFO L158 Benchmark]: TraceAbstraction took 1244.68ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 57.6MB in the end (delta: 61.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-14 22:29:21,306 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 159.4MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:29:21,308 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.18ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 941.30ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 63.8MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.27ms. Allocated memory is still 159.4MB. Free memory was 63.8MB in the beginning and 60.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.62ms. Allocated memory is still 159.4MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.80ms. Allocated memory is still 159.4MB. Free memory was 58.3MB in the beginning and 120.5MB in the end (delta: -62.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1244.68ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 57.6MB in the end (delta: 61.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 159.4MB. Free memory is still 57.6MB. 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: 1568]: 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 1576. 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); [L1576] 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) [L1576] 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] [L1577] CALL CWE190_Integer_Overflow__int_rand_multiply_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; [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; [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() [L1566] COND TRUE data > 0 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] [L1568] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1568]: 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, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 110 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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.4s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5/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-10-14 22:29:21,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_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 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:29:23,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:29:23,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-14 22:29:23,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:29:23,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:29:23,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-14 22:29:23,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:29:23,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:29:23,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:29:23,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:29:23,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:29:23,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:29:23,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:29:23,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:29:23,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:29:23,641 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:29:23,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:29:23,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:29:23,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:29:23,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:29:23,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:29:23,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:29:23,647 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 22:29:23,647 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 22:29:23,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:29:23,647 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:29:23,648 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 22:29:23,648 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:29:23,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:29:23,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:29:23,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:29:23,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:29:23,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:29:23,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:29:23,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:29:23,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:29:23,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:29:23,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:29:23,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 22:29:23,653 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 22:29:23,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:29:23,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:29:23,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:29:23,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:29:23,655 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 22:29:23,655 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 -> 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed [2024-10-14 22:29:23,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:29:24,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:29:24,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:29:24,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:29:24,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:29:24,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:25,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:29:25,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:29:25,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:25,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c2d161d/4d38440bdcea4e86afbb2052e01961d7/FLAG68542201e [2024-10-14 22:29:26,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c2d161d/4d38440bdcea4e86afbb2052e01961d7 [2024-10-14 22:29:26,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:29:26,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:29:26,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:29:26,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:29:26,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:29:26,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:29:26" (1/1) ... [2024-10-14 22:29:26,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a800bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:26, skipping insertion in model container [2024-10-14 22:29:26,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:29:26" (1/1) ... [2024-10-14 22:29:26,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:29:27,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:29:27,134 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:29:27,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:29:27,347 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:29:27,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27 WrapperNode [2024-10-14 22:29:27,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:29:27,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:29:27,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:29:27,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:29:27,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,410 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-10-14 22:29:27,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:29:27,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:29:27,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:29:27,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:29:27,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,435 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:29:27,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:29:27,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:29:27,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:29:27,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:29:27,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (1/1) ... [2024-10-14 22:29:27,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:29:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:29:27,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 22:29:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 22:29:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:29:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:29:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:29:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:29:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:29:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-14 22:29:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-14 22:29:27,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:29:27,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:29:27,811 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 22:29:27,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:29:27,861 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:29:27,862 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:29:27,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:27 BoogieIcfgContainer [2024-10-14 22:29:27,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:29:27,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:29:27,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:29:27,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:29:27,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:29:26" (1/3) ... [2024-10-14 22:29:27,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d90c04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:29:27, skipping insertion in model container [2024-10-14 22:29:27,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:29:27" (2/3) ... [2024-10-14 22:29:27,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d90c04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:29:27, skipping insertion in model container [2024-10-14 22:29:27,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:27" (3/3) ... [2024-10-14 22:29:27,872 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-10-14 22:29:27,888 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:29:27,888 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:29:27,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:29:27,953 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;@7dca2760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:29:27,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:29:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 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-10-14 22:29:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 22:29:27,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:27,965 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:29:27,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1547719223, now seen corresponding path program 1 times [2024-10-14 22:29:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:29:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110184900] [2024-10-14 22:29:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:29:27,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:29:27,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 22:29:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:28,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 22:29:28,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:29:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:29:28,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:29:28,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:29:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110184900] [2024-10-14 22:29:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110184900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:29:28,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:29:28,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 22:29:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819224616] [2024-10-14 22:29:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:29:28,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:29:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:29:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:29:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:29:28,209 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 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 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-14 22:29:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:29:28,254 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-14 22:29:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:29:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 17 [2024-10-14 22:29:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:29:28,261 INFO L225 Difference]: With dead ends: 41 [2024-10-14 22:29:28,262 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 22:29:28,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:29:28,267 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:29:28,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:29:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 22:29:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 22:29:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.2307692307692308) 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-10-14 22:29:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-14 22:29:28,298 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2024-10-14 22:29:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:29:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-14 22:29:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-14 22:29:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-14 22:29:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:29:28,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:28,301 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:29:28,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 22:29:28,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:28,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:28,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1634020306, now seen corresponding path program 1 times [2024-10-14 22:29:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:29:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522345543] [2024-10-14 22:29:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:29:28,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:29:28,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 22:29:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:29:28,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 22:29:28,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:29:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:29:28,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:29:28,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:29:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522345543] [2024-10-14 22:29:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522345543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:29:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:29:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:29:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077522533] [2024-10-14 22:29:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:29:28,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:29:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:29:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:29:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:29:28,632 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 22:29:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:29:28,653 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-14 22:29:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:29:28,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 22:29:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:29:28,655 INFO L225 Difference]: With dead ends: 20 [2024-10-14 22:29:28,655 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 22:29:28,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:29:28,656 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 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-10-14 22:29:28,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:29:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 22:29:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-14 22:29:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-10-14 22:29:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-14 22:29:28,664 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 19 [2024-10-14 22:29:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:29:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-14 22:29:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 22:29:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-14 22:29:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 22:29:28,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:29:28,667 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:29:28,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 22:29:28,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:28,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:29:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:29:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash -884977999, now seen corresponding path program 1 times [2024-10-14 22:29:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:29:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125960145] [2024-10-14 22:29:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:29:28,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:29:28,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:29:28,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 22:29:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:29:28,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:29:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:29:29,007 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 22:29:29,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:29:29,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:29:29,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:29:29,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 22:29:29,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:29:29,214 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 22:29:29,245 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:29:29,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:29:29 BoogieIcfgContainer [2024-10-14 22:29:29,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:29:29,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:29:29,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:29:29,250 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:29:29,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:29:27" (3/4) ... [2024-10-14 22:29:29,252 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:29:29,253 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:29:29,254 INFO L158 Benchmark]: Toolchain (without parser) took 3085.27ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.5MB in the beginning and 29.2MB in the end (delta: 11.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,255 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:29:29,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1178.41ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.3MB in the beginning and 35.0MB in the end (delta: 5.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 73.4MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,256 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 73.4MB. Free memory was 31.7MB in the beginning and 29.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,257 INFO L158 Benchmark]: RCFGBuilder took 405.66ms. Allocated memory is still 73.4MB. Free memory was 29.0MB in the beginning and 31.6MB in the end (delta: -2.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,257 INFO L158 Benchmark]: TraceAbstraction took 1384.75ms. Allocated memory is still 73.4MB. Free memory was 30.8MB in the beginning and 29.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-10-14 22:29:29,257 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 73.4MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:29:29,259 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.22ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1178.41ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.3MB in the beginning and 35.0MB in the end (delta: 5.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 73.4MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 73.4MB. Free memory was 31.7MB in the beginning and 29.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.66ms. Allocated memory is still 73.4MB. Free memory was 29.0MB in the beginning and 31.6MB in the end (delta: -2.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1384.75ms. Allocated memory is still 73.4MB. Free memory was 30.8MB in the beginning and 29.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 73.4MB. Free memory is still 29.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: 1568]: 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 1576. 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); [L1576] 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) [L1576] 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] [L1577] CALL CWE190_Integer_Overflow__int_rand_multiply_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; [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; [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1566] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1568]: 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, 24 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 41 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 22:29:29,298 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