./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_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 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:13:20,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:13:20,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 19:13:20,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:13:20,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:13:20,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:13:20,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:13:20,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:13:20,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:13:20,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:13:20,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:13:20,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:13:20,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:13:20,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:13:20,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:13:20,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:13:20,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:13:20,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 19:13:20,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:13:20,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:13:20,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:13:20,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:13:20,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:13:20,572 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:13:20,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:13:20,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:13:20,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:13:20,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:13:20,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:13:20,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:13:20,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:13:20,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:20,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:13:20,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:13:20,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:13:20,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:13:20,578 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 -> 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b [2024-11-12 19:13:20,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:13:20,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:13:20,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:13:20,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:13:20,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:13:20,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:22,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:13:22,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:13:22,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:22,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5c816f3/fd5f37d9a49941ec8681ae3b7de7a5ea/FLAG80695fae5 [2024-11-12 19:13:22,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5c816f3/fd5f37d9a49941ec8681ae3b7de7a5ea [2024-11-12 19:13:22,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:13:22,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:13:22,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:22,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:13:22,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:13:22,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:22" (1/1) ... [2024-11-12 19:13:22,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5836a72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:22, skipping insertion in model container [2024-11-12 19:13:22,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:22" (1/1) ... [2024-11-12 19:13:22,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:13:22,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:22,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:13:23,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:23,097 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:13:23,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23 WrapperNode [2024-11-12 19:13:23,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:23,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:23,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:13:23,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:13:23,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,148 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2024-11-12 19:13:23,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:23,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:13:23,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:13:23,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:13:23,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,170 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:13:23,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:13:23,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:13:23,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:13:23,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:13:23,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (1/1) ... [2024-11-12 19:13:23,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:13:23,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 19:13:23,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 19:13:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:13:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:13:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:13:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:13:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:13:23,357 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:13:23,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:13:23,570 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-12 19:13:23,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:13:23,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:13:23,583 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 19:13:23,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:23 BoogieIcfgContainer [2024-11-12 19:13:23,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:13:23,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:13:23,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:13:23,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:13:23,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:13:22" (1/3) ... [2024-11-12 19:13:23,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa9c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:23, skipping insertion in model container [2024-11-12 19:13:23,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:23" (2/3) ... [2024-11-12 19:13:23,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa9c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:23, skipping insertion in model container [2024-11-12 19:13:23,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:23" (3/3) ... [2024-11-12 19:13:23,591 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:23,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:13:23,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 19:13:23,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:13:23,661 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;@130da328, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:13:23,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 19:13:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 51 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:13:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 19:13:23,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:23,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:23,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 59979785, now seen corresponding path program 1 times [2024-11-12 19:13:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185359460] [2024-11-12 19:13:23,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:23,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185359460] [2024-11-12 19:13:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185359460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379965092] [2024-11-12 19:13:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:23,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:23,944 INFO L87 Difference]: Start difference. First operand has 55 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 51 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:23,970 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2024-11-12 19:13:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 19:13:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:23,977 INFO L225 Difference]: With dead ends: 102 [2024-11-12 19:13:23,977 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 19:13:23,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:23,981 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:23,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 19:13:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2024-11-12 19:13:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 47 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-12 19:13:24,009 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-11-12 19:13:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:24,009 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-12 19:13:24,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-11-12 19:13:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 19:13:24,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:24,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 19:13:24,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash 30617041, now seen corresponding path program 1 times [2024-11-12 19:13:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364954944] [2024-11-12 19:13:24,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:24,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:24,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364954944] [2024-11-12 19:13:24,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364954944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:24,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571894751] [2024-11-12 19:13:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 19:13:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 19:13:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:24,136 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:24,164 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-11-12 19:13:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 19:13:24,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 19:13:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:24,168 INFO L225 Difference]: With dead ends: 77 [2024-11-12 19:13:24,168 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 19:13:24,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:24,169 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:24,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 178 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 19:13:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 19:13:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 72 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-12 19:13:24,181 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 17 [2024-11-12 19:13:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:24,181 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-12 19:13:24,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-12 19:13:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 19:13:24,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:24,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:24,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 19:13:24,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:24,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1455957180, now seen corresponding path program 1 times [2024-11-12 19:13:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422215194] [2024-11-12 19:13:24,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 19:13:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422215194] [2024-11-12 19:13:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422215194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:13:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475572371] [2024-11-12 19:13:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:24,255 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:24,275 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2024-11-12 19:13:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-12 19:13:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:24,277 INFO L225 Difference]: With dead ends: 93 [2024-11-12 19:13:24,277 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 19:13:24,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:24,278 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:24,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 19:13:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-12 19:13:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.5) internal successors, (108), 76 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-11-12 19:13:24,284 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 23 [2024-11-12 19:13:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:24,284 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-11-12 19:13:24,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-11-12 19:13:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 19:13:24,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:24,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:24,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 19:13:24,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2109975774, now seen corresponding path program 1 times [2024-11-12 19:13:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501592689] [2024-11-12 19:13:24,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 19:13:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501592689] [2024-11-12 19:13:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501592689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311445483] [2024-11-12 19:13:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 19:13:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 19:13:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:24,364 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:24,386 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2024-11-12 19:13:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 19:13:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-12 19:13:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:24,388 INFO L225 Difference]: With dead ends: 93 [2024-11-12 19:13:24,388 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 19:13:24,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:24,389 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:24,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 19:13:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-12 19:13:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 87 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2024-11-12 19:13:24,394 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 24 [2024-11-12 19:13:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:24,395 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2024-11-12 19:13:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2024-11-12 19:13:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 19:13:24,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:24,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:24,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 19:13:24,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2109967830, now seen corresponding path program 1 times [2024-11-12 19:13:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941090608] [2024-11-12 19:13:24,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:24,418 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:13:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:24,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 19:13:24,458 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:13:24,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 19:13:24,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 19:13:24,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 19:13:24,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 19:13:24,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 19:13:24,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 19:13:24,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 19:13:24,464 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 19:13:24,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:13:24,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:13:24 BoogieIcfgContainer [2024-11-12 19:13:24,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:13:24,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:13:24,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:13:24,490 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:13:24,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:23" (3/4) ... [2024-11-12 19:13:24,494 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:13:24,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:13:24,496 INFO L158 Benchmark]: Toolchain (without parser) took 2153.29ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 60.8MB in the beginning and 122.8MB in the end (delta: -62.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:24,496 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:24,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.30ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 94.7MB in the end (delta: -34.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 176.2MB. Free memory was 94.7MB in the beginning and 91.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,497 INFO L158 Benchmark]: Boogie Preprocessor took 32.55ms. Allocated memory is still 176.2MB. Free memory was 91.4MB in the beginning and 88.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,497 INFO L158 Benchmark]: RCFGBuilder took 402.01ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 133.8MB in the end (delta: -45.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,497 INFO L158 Benchmark]: TraceAbstraction took 899.47ms. Allocated memory is still 176.2MB. Free memory was 133.8MB in the beginning and 123.9MB in the end (delta: 9.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,498 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 176.2MB. Free memory was 123.9MB in the beginning and 122.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:13:24,499 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.30ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 94.7MB in the end (delta: -34.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 176.2MB. Free memory was 94.7MB in the beginning and 91.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.55ms. Allocated memory is still 176.2MB. Free memory was 91.4MB in the beginning and 88.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.01ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 133.8MB in the end (delta: -45.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 899.47ms. Allocated memory is still 176.2MB. Free memory was 133.8MB in the beginning and 123.9MB in the end (delta: 9.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 176.2MB. Free memory was 123.9MB in the beginning and 122.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL 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) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1557] j = 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, j=0] [L1557] COND TRUE j < 1 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, j=0] [L1559] 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, j=0] [L1561] 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, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 258 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 19:13:24,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_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 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:13:26,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:13:26,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 19:13:26,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:13:26,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:13:26,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 19:13:26,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:13:26,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:13:26,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:13:26,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:13:26,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:13:26,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:13:26,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:13:26,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:13:26,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:13:26,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:13:26,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:13:26,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:13:26,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:13:26,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:13:26,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:13:26,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 19:13:26,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:13:26,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:13:26,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:13:26,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:13:26,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:13:26,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:13:26,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:13:26,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:26,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:13:26,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:13:26,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:13:26,426 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 19:13:26,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 19:13:26,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:13:26,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:13:26,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:13:26,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:13:26,431 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 -> 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b [2024-11-12 19:13:26,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:13:26,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:13:26,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:13:26,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:13:26,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:13:26,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:27,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:13:28,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:13:28,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:28,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbf72687/22e85a4f35af49579b3402e0ef20805a/FLAGc5029c18b [2024-11-12 19:13:28,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbf72687/22e85a4f35af49579b3402e0ef20805a [2024-11-12 19:13:28,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:13:28,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:13:28,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:28,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:13:28,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:13:28,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:28" (1/1) ... [2024-11-12 19:13:28,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b5c032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:28, skipping insertion in model container [2024-11-12 19:13:28,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:28" (1/1) ... [2024-11-12 19:13:28,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:13:29,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:29,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:13:29,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:29,384 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:13:29,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29 WrapperNode [2024-11-12 19:13:29,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:29,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:29,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:13:29,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:13:29,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,442 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2024-11-12 19:13:29,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:29,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:13:29,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:13:29,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:13:29,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,461 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:13:29,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:13:29,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:13:29,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:13:29,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:13:29,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (1/1) ... [2024-11-12 19:13:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:29,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:13:29,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-11-12 19:13:29,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-11-12 19:13:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:13:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:13:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:13:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:13:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:13:29,649 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:13:29,651 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:13:29,763 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-12 19:13:29,763 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:13:29,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:13:29,774 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 19:13:29,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:29 BoogieIcfgContainer [2024-11-12 19:13:29,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:13:29,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:13:29,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:13:29,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:13:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:13:28" (1/3) ... [2024-11-12 19:13:29,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366becca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:29, skipping insertion in model container [2024-11-12 19:13:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:29" (2/3) ... [2024-11-12 19:13:29,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366becca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:29, skipping insertion in model container [2024-11-12 19:13:29,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:29" (3/3) ... [2024-11-12 19:13:29,782 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-11-12 19:13:29,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:13:29,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 19:13:29,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:13:29,841 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;@5be99ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:13:29,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 19:13:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:13:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 19:13:29,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:29,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:29,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:29,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1113486713, now seen corresponding path program 1 times [2024-11-12 19:13:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134748338] [2024-11-12 19:13:29,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:29,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:29,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:13:29,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 19:13:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:29,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:13:29,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:13:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:30,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:13:30,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:13:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134748338] [2024-11-12 19:13:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134748338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369429848] [2024-11-12 19:13:30,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:13:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:30,031 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:30,057 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-12 19:13:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 19:13:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:30,065 INFO L225 Difference]: With dead ends: 61 [2024-11-12 19:13:30,065 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 19:13:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:30,070 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:30,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 19:13:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-12 19:13:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-12 19:13:30,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2024-11-12 19:13:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-12 19:13:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-12 19:13:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 19:13:30,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:30,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:30,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 19:13:30,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:30,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 202123720, now seen corresponding path program 1 times [2024-11-12 19:13:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315664999] [2024-11-12 19:13:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:30,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:13:30,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 19:13:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:30,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 19:13:30,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:13:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:30,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:13:30,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:13:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315664999] [2024-11-12 19:13:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315664999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:30,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118326640] [2024-11-12 19:13:30,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:30,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 19:13:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:13:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 19:13:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:30,408 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:30,434 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-12 19:13:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 19:13:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 19:13:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:30,435 INFO L225 Difference]: With dead ends: 34 [2024-11-12 19:13:30,436 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 19:13:30,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 19:13:30,437 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:30,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 19:13:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 19:13:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 30 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-12 19:13:30,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2024-11-12 19:13:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:30,442 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-12 19:13:30,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-12 19:13:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 19:13:30,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:30,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:30,450 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-11-12 19:13:30,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -365775982, now seen corresponding path program 1 times [2024-11-12 19:13:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442575226] [2024-11-12 19:13:30,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:30,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:30,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:13:30,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 19:13:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:30,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:13:30,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:13:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 19:13:30,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:13:30,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:13:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442575226] [2024-11-12 19:13:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442575226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:13:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208888071] [2024-11-12 19:13:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:13:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:30,752 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:30,770 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-12 19:13:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:30,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 19:13:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:30,771 INFO L225 Difference]: With dead ends: 49 [2024-11-12 19:13:30,771 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 19:13:30,771 INFO L434 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-11-12 19:13:30,772 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:30,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 19:13:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-12 19:13:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-12 19:13:30,792 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 19 [2024-11-12 19:13:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-12 19:13:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-12 19:13:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 19:13:30,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:30,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:30,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 19:13:30,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 19:13:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1545846528, now seen corresponding path program 1 times [2024-11-12 19:13:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431952410] [2024-11-12 19:13:30,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:30,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:13:31,000 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 (5)] Waiting until timeout for monitored process [2024-11-12 19:13:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:31,046 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:13:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:31,097 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 19:13:31,098 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:13:31,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 19:13:31,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 19:13:31,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 19:13:31,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 19:13:31,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 19:13:31,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 19:13:31,109 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 19:13:31,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:13:31,307 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 19:13:31,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:13:31,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:13:31 BoogieIcfgContainer [2024-11-12 19:13:31,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:13:31,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:13:31,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:13:31,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:13:31,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:29" (3/4) ... [2024-11-12 19:13:31,336 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:13:31,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:13:31,338 INFO L158 Benchmark]: Toolchain (without parser) took 2791.96ms. Allocated memory was 62.9MB in the beginning and 119.5MB in the end (delta: 56.6MB). Free memory was 37.0MB in the beginning and 78.3MB in the end (delta: -41.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-12 19:13:31,338 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:31,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 838.01ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 36.8MB in the beginning and 41.5MB in the end (delta: -4.7MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-12 19:13:31,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.08ms. Allocated memory is still 96.5MB. Free memory was 41.5MB in the beginning and 68.5MB in the end (delta: -27.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-12 19:13:31,339 INFO L158 Benchmark]: Boogie Preprocessor took 30.40ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 65.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:13:31,339 INFO L158 Benchmark]: RCFGBuilder took 300.89ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 50.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 19:13:31,340 INFO L158 Benchmark]: TraceAbstraction took 1556.32ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 49.6MB in the beginning and 79.0MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:31,340 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 78.3MB in the end (delta: 706.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:31,341 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.13ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 838.01ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 36.8MB in the beginning and 41.5MB in the end (delta: -4.7MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.08ms. Allocated memory is still 96.5MB. Free memory was 41.5MB in the beginning and 68.5MB in the end (delta: -27.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.40ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 65.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.89ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 50.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1556.32ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 49.6MB in the beginning and 79.0MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 78.3MB in the end (delta: 706.9kB). 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: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL 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) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1557] j = 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, j=0] [L1557] COND TRUE j < 1 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, j=0] [L1559] 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, j=0] [L1561] 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, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 95 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 19:13:31,372 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