./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/hard.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/hard.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash bf4084038551b4d4dee908f8b840106d6ac9404d49a5054c0a9fd13f046dedeb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:01:51,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:01:51,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:01:51,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:01:51,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:01:51,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:01:51,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:01:51,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:01:51,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:01:51,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:01:51,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:01:51,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:01:51,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:01:51,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:01:51,767 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:01:51,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:01:51,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:01:51,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:01:51,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:01:51,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:01:51,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:01:51,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:01:51,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:01:51,771 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf4084038551b4d4dee908f8b840106d6ac9404d49a5054c0a9fd13f046dedeb [2025-03-09 02:01:51,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:01:51,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:01:51,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:01:51,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:01:51,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:01:51,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/hard.c [2025-03-09 02:01:53,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a80dd5/5f901b543c59456cae064c022028f362/FLAGd0ef8e495 [2025-03-09 02:01:53,263 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:01:53,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/hard.c [2025-03-09 02:01:53,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a80dd5/5f901b543c59456cae064c022028f362/FLAGd0ef8e495 [2025-03-09 02:01:53,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a80dd5/5f901b543c59456cae064c022028f362 [2025-03-09 02:01:53,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:01:53,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:01:53,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:01:53,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:01:53,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:01:53,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53, skipping insertion in model container [2025-03-09 02:01:53,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:01:53,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:01:53,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:01:53,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:01:53,441 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:01:53,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53 WrapperNode [2025-03-09 02:01:53,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:01:53,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:01:53,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:01:53,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:01:53,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,463 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2025-03-09 02:01:53,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:01:53,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:01:53,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:01:53,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:01:53,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,484 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-09 02:01:53,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:01:53,490 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:01:53,490 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:01:53,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:01:53,491 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (1/1) ... [2025-03-09 02:01:53,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:01:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:01:53,514 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) [2025-03-09 02:01:53,515 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 [2025-03-09 02:01:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:01:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:01:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:01:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:01:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:01:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:01:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:01:53,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:01:53,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:01:53,821 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-09 02:01:53,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:01:53,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:01:53,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:01:53,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:01:53 BoogieIcfgContainer [2025-03-09 02:01:53,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:01:53,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:01:53,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:01:53,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:01:53,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:01:53" (1/3) ... [2025-03-09 02:01:53,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb7e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:01:53, skipping insertion in model container [2025-03-09 02:01:53,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:01:53" (2/3) ... [2025-03-09 02:01:53,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb7e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:01:53, skipping insertion in model container [2025-03-09 02:01:53,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:01:53" (3/3) ... [2025-03-09 02:01:53,840 INFO L128 eAbstractionObserver]: Analyzing ICFG hard.c [2025-03-09 02:01:53,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:01:53,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard.c that has 2 procedures, 72 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-03-09 02:01:53,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:01:53,906 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;@4d82e21a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:01:53,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 02:01:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:01:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:01:53,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:53,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:01:53,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1337638612, now seen corresponding path program 1 times [2025-03-09 02:01:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023850397] [2025-03-09 02:01:53,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:01:53,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:01:53,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:01:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:01:54,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:01:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023850397] [2025-03-09 02:01:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023850397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:01:54,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:01:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:01:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642252361] [2025-03-09 02:01:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:01:54,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:01:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:01:54,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:01:54,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:01:54,034 INFO L87 Difference]: Start difference. First operand has 72 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:01:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:01:54,048 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2025-03-09 02:01:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:01:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:01:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:01:54,052 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:01:54,053 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 02:01:54,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:01:54,060 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:01:54,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:01:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 02:01:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-09 02:01:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:01:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-03-09 02:01:54,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2025-03-09 02:01:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:01:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-03-09 02:01:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:01:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-03-09 02:01:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:01:54,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:54,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:01:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:01:54,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1606297948, now seen corresponding path program 1 times [2025-03-09 02:01:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756063508] [2025-03-09 02:01:54,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:54,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:01:54,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:01:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:01:54,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991055804] [2025-03-09 02:01:54,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:54,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:01:54,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:01:54,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:01:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:01:54,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:01:54,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:54,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:01:54,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:01:54,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:01:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:01:54,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:01:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:01:54,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756063508] [2025-03-09 02:01:54,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:01:54,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991055804] [2025-03-09 02:01:54,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991055804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:01:54,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:01:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:01:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145625381] [2025-03-09 02:01:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:01:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:01:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:01:54,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:01:54,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:01:54,231 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:01:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:01:54,330 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2025-03-09 02:01:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:01:54,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-09 02:01:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:01:54,332 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:01:54,332 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 02:01:54,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:01:54,333 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:01:54,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 92 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:01:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 02:01:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-03-09 02:01:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 71 states have internal predecessors, (83), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:01:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-03-09 02:01:54,348 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 15 [2025-03-09 02:01:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:01:54,348 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-09 02:01:54,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:01:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2025-03-09 02:01:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:01:54,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:54,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:01:54,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:01:54,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:54,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:54,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1744371193, now seen corresponding path program 1 times [2025-03-09 02:01:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:54,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592534848] [2025-03-09 02:01:54,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:54,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:01:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:01:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:01:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416463308] [2025-03-09 02:01:54,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:01:54,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:01:54,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:01:54,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:01:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:01:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:01:54,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:01:54,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:01:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:01:54,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:01:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:01:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592534848] [2025-03-09 02:01:54,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:01:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416463308] [2025-03-09 02:01:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416463308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:01:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:01:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:01:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961399041] [2025-03-09 02:01:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:01:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:01:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:01:54,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:01:54,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:01:54,660 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:01:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:01:54,760 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2025-03-09 02:01:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:01:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-09 02:01:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:01:54,761 INFO L225 Difference]: With dead ends: 87 [2025-03-09 02:01:54,761 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 02:01:54,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:01:54,762 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:01:54,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 92 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:01:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 02:01:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-03-09 02:01:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6875) internal successors, (81), 71 states have internal predecessors, (81), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:01:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-03-09 02:01:54,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 16 [2025-03-09 02:01:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:01:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-03-09 02:01:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:01:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-03-09 02:01:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:01:54,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:54,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:01:54,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:01:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 02:01:54,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1479458051, now seen corresponding path program 1 times [2025-03-09 02:01:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632714777] [2025-03-09 02:01:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:54,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:01:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:01:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:01:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368474337] [2025-03-09 02:01:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:01:54,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:01:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:01:55,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:01:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:01:55,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:55,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:01:55,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:01:55,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:01:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:01:55,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:01:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:01:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632714777] [2025-03-09 02:01:55,059 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:01:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368474337] [2025-03-09 02:01:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368474337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:01:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:01:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:01:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328442107] [2025-03-09 02:01:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:01:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:01:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:01:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:01:55,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:01:55,061 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:01:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:01:55,116 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2025-03-09 02:01:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:01:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-09 02:01:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:01:55,117 INFO L225 Difference]: With dead ends: 117 [2025-03-09 02:01:55,117 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 02:01:55,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:01:55,118 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:01:55,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 87 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:01:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 02:01:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2025-03-09 02:01:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 85 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:01:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2025-03-09 02:01:55,126 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 23 [2025-03-09 02:01:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:01:55,126 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2025-03-09 02:01:55,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:01:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2025-03-09 02:01:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:01:55,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:55,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:01:55,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:01:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:55,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1479458011, now seen corresponding path program 1 times [2025-03-09 02:01:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572103593] [2025-03-09 02:01:55,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:55,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:01:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:01:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:55,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:01:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:01:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:01:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572103593] [2025-03-09 02:01:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572103593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:01:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:01:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:01:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354244986] [2025-03-09 02:01:55,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:01:55,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:01:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:01:55,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:01:55,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:01:55,462 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:01:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:01:55,553 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2025-03-09 02:01:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:01:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-09 02:01:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:01:55,554 INFO L225 Difference]: With dead ends: 119 [2025-03-09 02:01:55,554 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 02:01:55,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:01:55,555 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 141 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:01:55,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 78 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:01:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 02:01:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2025-03-09 02:01:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 92 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 02:01:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2025-03-09 02:01:55,567 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 23 [2025-03-09 02:01:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:01:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2025-03-09 02:01:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:01:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2025-03-09 02:01:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:01:55,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:01:55,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:01:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:01:55,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:01:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:01:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1381441937, now seen corresponding path program 1 times [2025-03-09 02:01:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:01:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392429004] [2025-03-09 02:01:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:01:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:01:55,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:01:55,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:55,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:01:55,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805329144] [2025-03-09 02:01:55,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:01:55,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:55,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:01:55,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:01:55,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:01:55,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:01:55,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:01:55,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:55,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:01:55,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 02:01:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:01:55,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:01:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:01:55,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:01:55,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 02:01:55,633 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 02:01:55,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-09 02:01:55,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-09 02:01:55,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-09 02:01:55,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-09 02:01:55,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:01:55,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:01:55,840 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 02:01:55,853 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:01:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:01:55 BoogieIcfgContainer [2025-03-09 02:01:55,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:01:55,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:01:55,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:01:55,857 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:01:55,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:01:53" (3/4) ... [2025-03-09 02:01:55,857 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 02:01:55,891 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 14. [2025-03-09 02:01:55,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:01:55,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:01:55,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:01:55,926 INFO L158 Benchmark]: Toolchain (without parser) took 2627.44ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 51.8MB in the end (delta: 54.6MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.80ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.92ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: Boogie Preprocessor took 25.68ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.6MB in the end (delta: 625.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: IcfgBuilder took 341.26ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 76.8MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: TraceAbstraction took 2023.15ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 57.9MB in the end (delta: 17.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2025-03-09 02:01:55,926 INFO L158 Benchmark]: Witness Printer took 68.72ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:01:55,927 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.80ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.92ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.68ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.6MB in the end (delta: 625.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 341.26ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 76.8MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2023.15ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 57.9MB in the end (delta: 17.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 68.72ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 40]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = __VERIFIER_nondet_int() [L27] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) [L27] RET assume_abort_if_not(B >= 1) [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L35] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L36] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L37] EXPR B * p VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L37] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L38] COND FALSE !(!(r >= d)) VAL [A=1073741824, B=1073741824, d=1073741824, p=1, q=0, r=1073741824] [L40] 2 * d VAL [A=1073741824, B=1073741824, p=1, q=0, r=1073741824] - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: 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, 72 locations, 91 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 262 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 272 mSDtfsCounter, 262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 32/32 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-09 02:01:55,940 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)