./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_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 b0fee0b1a3f7bb56ee555a8322d6a7166ded38b2509b70848a6a8dbdb8f0aacd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:23:44,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:23:44,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 20:23:44,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:23:44,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:23:44,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:23:44,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:23:44,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:23:44,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:23:44,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:23:44,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:23:44,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:23:44,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:23:44,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:23:44,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:23:44,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:23:44,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:23:44,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 20:23:44,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:23:44,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:23:44,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:23:44,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:23:44,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:23:44,673 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:23:44,673 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:23:44,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:23:44,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:23:44,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:23:44,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:23:44,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:23:44,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:23:44,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:23:44,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:23:44,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:23:44,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:23:44,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:23:44,677 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 -> b0fee0b1a3f7bb56ee555a8322d6a7166ded38b2509b70848a6a8dbdb8f0aacd [2024-11-20 20:23:44,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:23:44,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:23:44,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:23:44,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:23:44,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:23:44,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:46,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:23:46,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:23:46,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:46,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181e3d5dc/8c28370117df4d769914fdd1266c48c4/FLAG4aee3434e [2024-11-20 20:23:46,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181e3d5dc/8c28370117df4d769914fdd1266c48c4 [2024-11-20 20:23:46,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:23:46,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:23:46,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:23:46,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:23:46,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:23:46,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:46" (1/1) ... [2024-11-20 20:23:46,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b647544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:46, skipping insertion in model container [2024-11-20 20:23:46,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:46" (1/1) ... [2024-11-20 20:23:46,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:23:47,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:23:47,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:23:47,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:23:47,422 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:23:47,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47 WrapperNode [2024-11-20 20:23:47,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:23:47,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:23:47,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:23:47,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:23:47,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,479 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-20 20:23:47,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:23:47,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:23:47,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:23:47,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:23:47,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,510 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:23:47,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:23:47,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:23:47,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:23:47,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:23:47,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (1/1) ... [2024-11-20 20:23:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:23:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:23:47,565 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-20 20:23:47,574 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-20 20:23:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:23:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:23:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:23:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:23:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:23:47,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:23:47,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:23:47,835 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 20:23:47,835 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:23:47,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:23:47,844 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:23:47,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:47 BoogieIcfgContainer [2024-11-20 20:23:47,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:23:47,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:23:47,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:23:47,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:23:47,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:23:46" (1/3) ... [2024-11-20 20:23:47,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f93dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:47, skipping insertion in model container [2024-11-20 20:23:47,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:47" (2/3) ... [2024-11-20 20:23:47,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f93dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:47, skipping insertion in model container [2024-11-20 20:23:47,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:47" (3/3) ... [2024-11-20 20:23:47,853 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:47,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:23:47,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:23:47,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:23:47,923 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;@1d8c3801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:23:47,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:23:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 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-20 20:23:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 20:23:47,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:47,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:47,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:47,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash -83184607, now seen corresponding path program 1 times [2024-11-20 20:23:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:23:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923940340] [2024-11-20 20:23:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:23:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:23:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:48,388 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-20 20:23:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:23:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923940340] [2024-11-20 20:23:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923940340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:23:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:23:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 20:23:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866986485] [2024-11-20 20:23:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:23:48,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 20:23:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:23:48,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 20:23:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 20:23:48,434 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 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 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-20 20:23:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:23:48,524 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-20 20:23:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 20:23:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 12 [2024-11-20 20:23:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:23:48,530 INFO L225 Difference]: With dead ends: 45 [2024-11-20 20:23:48,530 INFO L226 Difference]: Without dead ends: 15 [2024-11-20 20:23:48,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 20:23:48,535 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:23:48,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 61 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:23:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-20 20:23:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-20 20:23:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 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-20 20:23:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2024-11-20 20:23:48,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 12 [2024-11-20 20:23:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:23:48,577 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2024-11-20 20:23:48,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-20 20:23:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2024-11-20 20:23:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 20:23:48,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:48,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:48,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 20:23:48,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:48,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash -83244189, now seen corresponding path program 1 times [2024-11-20 20:23:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:23:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330379262] [2024-11-20 20:23:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:23:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:23:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:48,672 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-20 20:23:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:23:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330379262] [2024-11-20 20:23:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330379262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:23:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:23:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:23:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904964756] [2024-11-20 20:23:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:23:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:23:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:23:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:23:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:23:48,675 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-20 20:23:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:23:48,689 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2024-11-20 20:23:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:23:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-20 20:23:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:23:48,690 INFO L225 Difference]: With dead ends: 15 [2024-11-20 20:23:48,691 INFO L226 Difference]: Without dead ends: 14 [2024-11-20 20:23:48,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:23:48,693 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:23:48,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:23:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-20 20:23:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-20 20:23:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.0) internal successors, (11), 11 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-20 20:23:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-11-20 20:23:48,698 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2024-11-20 20:23:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:23:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-11-20 20:23:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-20 20:23:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-11-20 20:23:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 20:23:48,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:48,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 20:23:48,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:48,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1714397495, now seen corresponding path program 1 times [2024-11-20 20:23:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:23:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520433204] [2024-11-20 20:23:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:23:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:23:48,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:23:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:23:48,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 20:23:48,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:23:48,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:23:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:23:48,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 20:23:48,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 20:23:48,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:23:48,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:23:48 BoogieIcfgContainer [2024-11-20 20:23:48,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:23:48,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:23:48,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:23:48,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:23:48,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:47" (3/4) ... [2024-11-20 20:23:48,794 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:23:48,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:23:48,796 INFO L158 Benchmark]: Toolchain (without parser) took 2256.84ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 55.1MB in the beginning and 105.0MB in the end (delta: -49.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:48,797 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 125.8MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:48,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 881.45ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 54.9MB in the beginning and 86.0MB in the end (delta: -31.1MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-20 20:23:48,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.38ms. Allocated memory is still 176.2MB. Free memory was 86.0MB in the beginning and 82.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:23:48,800 INFO L158 Benchmark]: Boogie Preprocessor took 40.39ms. Allocated memory is still 176.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:23:48,800 INFO L158 Benchmark]: RCFGBuilder took 323.81ms. Allocated memory is still 176.2MB. Free memory was 80.8MB in the beginning and 68.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 20:23:48,800 INFO L158 Benchmark]: TraceAbstraction took 944.56ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 105.0MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:48,800 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 176.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:48,801 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.08ms. Allocated memory is still 125.8MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 881.45ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 54.9MB in the beginning and 86.0MB in the end (delta: -31.1MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.38ms. Allocated memory is still 176.2MB. Free memory was 86.0MB in the beginning and 82.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.39ms. Allocated memory is still 176.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.81ms. Allocated memory is still 176.2MB. Free memory was 80.8MB in the beginning and 68.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 944.56ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 105.0MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 176.2MB. Free memory is still 105.0MB. 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: 1562]: 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 1570. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticTrue = 1; [L1549] static int staticFalse = 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, staticFalse=0, staticTrue=1] [L1570] 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, staticFalse=0, staticTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] 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, staticFalse=0, staticTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_max_multiply_05_bad() [L1552] int data; [L1553] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFalse=0, staticTrue=1] [L1554] COND TRUE \read(staticTrue) [L1556] data = 0x7fffffff 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, staticFalse=0, staticTrue=1] [L1558] COND TRUE \read(staticTrue) 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, staticFalse=0, staticTrue=1] [L1560] 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, staticFalse=0, staticTrue=1] [L1562] 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, staticFalse=0, staticTrue=1] - UnprovableResult [Line: 1562]: 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, 22 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 28 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:23:48,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_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 b0fee0b1a3f7bb56ee555a8322d6a7166ded38b2509b70848a6a8dbdb8f0aacd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:23:50,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:23:50,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 20:23:50,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:23:50,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:23:50,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 20:23:50,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:23:50,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:23:50,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:23:50,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:23:50,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:23:50,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:23:50,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:23:50,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:23:50,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:23:50,750 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:23:50,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:23:50,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:23:50,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:23:50,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:23:50,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:23:50,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:23:50,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:23:50,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:23:50,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:23:50,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:23:50,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 20:23:50,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 20:23:50,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:23:50,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:23:50,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:23:50,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:23:50,759 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 -> b0fee0b1a3f7bb56ee555a8322d6a7166ded38b2509b70848a6a8dbdb8f0aacd [2024-11-20 20:23:51,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:23:51,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:23:51,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:23:51,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:23:51,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:23:51,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:52,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:23:52,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:23:52,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:52,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b724fffed/345dffad35134d6fb8e5281b1109c80b/FLAGf3a58ff9e [2024-11-20 20:23:52,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b724fffed/345dffad35134d6fb8e5281b1109c80b [2024-11-20 20:23:52,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:23:52,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:23:52,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:23:52,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:23:52,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:23:52,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:52" (1/1) ... [2024-11-20 20:23:52,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d45b13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:52, skipping insertion in model container [2024-11-20 20:23:52,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:52" (1/1) ... [2024-11-20 20:23:52,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:23:53,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:23:53,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:23:53,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:23:53,860 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:23:53,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53 WrapperNode [2024-11-20 20:23:53,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:23:53,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:23:53,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:23:53,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:23:53,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,912 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-20 20:23:53,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:23:53,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:23:53,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:23:53,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:23:53,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,936 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:23:53,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:23:53,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:23:53,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:23:53,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:23:53,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (1/1) ... [2024-11-20 20:23:53,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:23:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:23:53,993 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-20 20:23:54,003 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-20 20:23:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:23:54,042 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:23:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:23:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:23:54,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:23:54,154 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:23:54,156 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:23:54,264 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 20:23:54,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:23:54,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:23:54,274 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:23:54,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:54 BoogieIcfgContainer [2024-11-20 20:23:54,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:23:54,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:23:54,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:23:54,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:23:54,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:23:52" (1/3) ... [2024-11-20 20:23:54,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13320a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:54, skipping insertion in model container [2024-11-20 20:23:54,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:53" (2/3) ... [2024-11-20 20:23:54,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13320a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:54, skipping insertion in model container [2024-11-20 20:23:54,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:54" (3/3) ... [2024-11-20 20:23:54,282 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_05_bad.i [2024-11-20 20:23:54,294 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:23:54,295 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:23:54,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:23:54,349 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;@572c432e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:23:54,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:23:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 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-20 20:23:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 20:23:54,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:54,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:54,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash -83184607, now seen corresponding path program 1 times [2024-11-20 20:23:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:23:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717137505] [2024-11-20 20:23:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:54,374 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-20 20:23:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:23:54,376 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-20 20:23:54,377 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-20 20:23:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:54,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 20:23:54,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:23:54,543 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-20 20:23:54,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:23:54,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:23:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717137505] [2024-11-20 20:23:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717137505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:23:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:23:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:23:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938112960] [2024-11-20 20:23:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:23:54,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:23:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:23:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:23:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:23:54,571 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-20 20:23:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:23:54,589 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-20 20:23:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:23:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-11-20 20:23:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:23:54,596 INFO L225 Difference]: With dead ends: 39 [2024-11-20 20:23:54,597 INFO L226 Difference]: Without dead ends: 15 [2024-11-20 20:23:54,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-20 20:23:54,602 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:23:54,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:23:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-20 20:23:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-20 20:23:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:23:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-20 20:23:54,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2024-11-20 20:23:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:23:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-20 20:23:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-20 20:23:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-20 20:23:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 20:23:54,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:54,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:54,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 20:23:54,829 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-20 20:23:54,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:54,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -83244189, now seen corresponding path program 1 times [2024-11-20 20:23:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:23:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049891376] [2024-11-20 20:23:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:54,832 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-20 20:23:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:23:54,834 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-20 20:23:54,845 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-20 20:23:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:23:54,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 20:23:54,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:23:54,925 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-20 20:23:54,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:23:54,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:23:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049891376] [2024-11-20 20:23:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049891376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:23:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:23:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:23:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582721954] [2024-11-20 20:23:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:23:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:23:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:23:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:23:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:23:54,927 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-20 20:23:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:23:54,941 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-20 20:23:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:23:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-20 20:23:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:23:54,942 INFO L225 Difference]: With dead ends: 15 [2024-11-20 20:23:54,942 INFO L226 Difference]: Without dead ends: 14 [2024-11-20 20:23:54,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-20 20:23:54,944 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:23:54,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:23:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-20 20:23:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-20 20:23:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:23:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-20 20:23:54,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2024-11-20 20:23:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:23:54,947 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-20 20:23:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-20 20:23:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-20 20:23:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 20:23:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:23:54,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:23:54,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 20:23:55,148 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-20 20:23:55,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:23:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:23:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1714397495, now seen corresponding path program 1 times [2024-11-20 20:23:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:23:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611148470] [2024-11-20 20:23:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:23:55,150 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-20 20:23:55,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:23:55,156 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-20 20:23:55,159 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-20 20:23:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:23:55,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:23:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:23:55,233 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 20:23:55,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:23:55,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:23:55,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:23:55,240 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-20 20:23:55,439 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-20 20:23:55,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 20:23:55,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:23:55,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:23:55 BoogieIcfgContainer [2024-11-20 20:23:55,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:23:55,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:23:55,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:23:55,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:23:55,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:54" (3/4) ... [2024-11-20 20:23:55,541 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:23:55,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:23:55,548 INFO L158 Benchmark]: Toolchain (without parser) took 2682.29ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 49.6MB in the beginning and 100.7MB in the end (delta: -51.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:55,548 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 88.1MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:55,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 993.72ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 49.3MB in the beginning and 75.6MB in the end (delta: -26.2MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-20 20:23:55,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.75ms. Allocated memory is still 132.1MB. Free memory was 75.6MB in the beginning and 72.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:23:55,552 INFO L158 Benchmark]: Boogie Preprocessor took 48.37ms. Allocated memory is still 132.1MB. Free memory was 72.4MB in the beginning and 70.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:23:55,552 INFO L158 Benchmark]: RCFGBuilder took 313.03ms. Allocated memory is still 132.1MB. Free memory was 70.2MB in the beginning and 56.7MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 20:23:55,552 INFO L158 Benchmark]: TraceAbstraction took 1260.69ms. Allocated memory is still 132.1MB. Free memory was 55.8MB in the beginning and 100.7MB in the end (delta: -44.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:55,552 INFO L158 Benchmark]: Witness Printer took 8.61ms. Allocated memory is still 132.1MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:23:55,554 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.77ms. Allocated memory is still 88.1MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 993.72ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 49.3MB in the beginning and 75.6MB in the end (delta: -26.2MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.75ms. Allocated memory is still 132.1MB. Free memory was 75.6MB in the beginning and 72.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.37ms. Allocated memory is still 132.1MB. Free memory was 72.4MB in the beginning and 70.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 313.03ms. Allocated memory is still 132.1MB. Free memory was 70.2MB in the beginning and 56.7MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1260.69ms. Allocated memory is still 132.1MB. Free memory was 55.8MB in the beginning and 100.7MB in the end (delta: -44.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.61ms. Allocated memory is still 132.1MB. Free memory is still 100.7MB. 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: 1562]: 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 1570. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticTrue = 1; [L1549] static int staticFalse = 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, staticFalse=0, staticTrue=1] [L1570] 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, staticFalse=0, staticTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] 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, staticFalse=0, staticTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_max_multiply_05_bad() [L1552] int data; [L1553] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFalse=0, staticTrue=1] [L1554] COND TRUE \read(staticTrue) [L1556] data = 0x7fffffff 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, staticFalse=0, staticTrue=1] [L1558] COND TRUE \read(staticTrue) 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, staticFalse=0, staticTrue=1] [L1560] 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, staticFalse=0, staticTrue=1] [L1562] 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, staticFalse=0, staticTrue=1] - UnprovableResult [Line: 1562]: 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, 22 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 33 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:23:55,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample