./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i --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/loop-zilu/benchmark04_conjunctive.i -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 6b9a965f73c3cec90a7bf30e1abcce707e2acf95b41bbd45e0beb5b55c7fe39d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:59,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:59,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:57:59,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:59,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:59,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:59,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:59,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:59,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:59,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:59,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:59,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:59,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:59,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:59,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:59,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:59,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:59,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:59,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:59,724 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 -> 6b9a965f73c3cec90a7bf30e1abcce707e2acf95b41bbd45e0beb5b55c7fe39d [2025-03-09 01:57:59,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:59,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:59,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:59,955 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:59,955 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:59,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i [2025-03-09 01:58:01,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8182c45/413e0f8d4d4a4532a9bb25a22bca9ea1/FLAG3715a5bd6 [2025-03-09 01:58:01,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:58:01,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i [2025-03-09 01:58:01,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8182c45/413e0f8d4d4a4532a9bb25a22bca9ea1/FLAG3715a5bd6 [2025-03-09 01:58:01,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8182c45/413e0f8d4d4a4532a9bb25a22bca9ea1 [2025-03-09 01:58:01,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:58:01,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:58:01,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:58:01,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:58:01,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:58:01,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5ee1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01, skipping insertion in model container [2025-03-09 01:58:01,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:58:01,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:58:01,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:58:01,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:58:01,837 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:58:01,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01 WrapperNode [2025-03-09 01:58:01,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:58:01,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:58:01,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:58:01,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:58:01,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,855 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2025-03-09 01:58:01,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:58:01,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:58:01,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:58:01,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:58:01,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:58:01,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:58:01,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:58:01,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:58:01,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:58:01,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (1/1) ... [2025-03-09 01:58:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:58:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:01,902 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 01:58:01,904 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 01:58:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:58:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:58:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:58:01,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:58:01,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:58:01,958 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:58:02,058 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 01:58:02,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:58:02,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:58:02,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:58:02,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:58:02 BoogieIcfgContainer [2025-03-09 01:58:02,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:58:02,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:58:02,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:58:02,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:58:02,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:58:01" (1/3) ... [2025-03-09 01:58:02,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d8a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:58:02, skipping insertion in model container [2025-03-09 01:58:02,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:01" (2/3) ... [2025-03-09 01:58:02,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d8a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:58:02, skipping insertion in model container [2025-03-09 01:58:02,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:58:02" (3/3) ... [2025-03-09 01:58:02,077 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.i [2025-03-09 01:58:02,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:58:02,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark04_conjunctive.i that has 1 procedures, 24 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 01:58:02,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:58:02,149 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;@512892cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:58:02,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:58:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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 01:58:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:58:02,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:58:02,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1846012, now seen corresponding path program 1 times [2025-03-09 01:58:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315553633] [2025-03-09 01:58:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:58:02,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:58:02,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,296 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 01:58:02,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315553633] [2025-03-09 01:58:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315553633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:58:02,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781756406] [2025-03-09 01:58:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:58:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:58:02,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:58:02,316 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:58:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,336 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-09 01:58:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:58:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 01:58:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,341 INFO L225 Difference]: With dead ends: 31 [2025-03-09 01:58:02,341 INFO L226 Difference]: Without dead ends: 15 [2025-03-09 01:58:02,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:58:02,344 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-09 01:58:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 01:58:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 14 states have internal predecessors, (15), 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 01:58:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-09 01:58:02,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 4 [2025-03-09 01:58:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-09 01:58:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:58:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-09 01:58:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:58:02,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:58:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:58:02,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 57226363, now seen corresponding path program 1 times [2025-03-09 01:58:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067750217] [2025-03-09 01:58:02,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:58:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:58:02,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,394 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 01:58:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067750217] [2025-03-09 01:58:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067750217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:58:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243269254] [2025-03-09 01:58:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:58:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:58:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:58:02,396 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 01:58:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,402 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-09 01:58:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:58:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 01:58:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,403 INFO L225 Difference]: With dead ends: 15 [2025-03-09 01:58:02,403 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 01:58:02,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:58:02,404 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 01:58:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 01:58:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 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 01:58:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:58:02,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 5 [2025-03-09 01:58:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,407 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:58:02,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 01:58:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:58:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:58:02,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:58:02,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -840040330, now seen corresponding path program 1 times [2025-03-09 01:58:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118898225] [2025-03-09 01:58:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:58:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:58:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,454 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 01:58:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118898225] [2025-03-09 01:58:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118898225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278180993] [2025-03-09 01:58:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,456 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 01:58:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,473 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-09 01:58:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-09 01:58:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,476 INFO L225 Difference]: With dead ends: 14 [2025-03-09 01:58:02,476 INFO L226 Difference]: Without dead ends: 13 [2025-03-09 01:58:02,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,476 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-09 01:58:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 01:58:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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 01:58:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-09 01:58:02,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-03-09 01:58:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-09 01:58:02,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 01:58:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-09 01:58:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:58:02,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:58:02,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -271446471, now seen corresponding path program 1 times [2025-03-09 01:58:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329599618] [2025-03-09 01:58:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:58:02,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:58:02,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,537 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 01:58:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329599618] [2025-03-09 01:58:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329599618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633183805] [2025-03-09 01:58:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:02,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,538 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 01:58:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,553 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 01:58:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:02,553 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), 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 8 [2025-03-09 01:58:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,553 INFO L225 Difference]: With dead ends: 19 [2025-03-09 01:58:02,553 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 01:58:02,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,554 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 01:58:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 01:58:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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 01:58:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-09 01:58:02,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-09 01:58:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,557 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-09 01:58:02,557 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), 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 01:58:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-09 01:58:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:58:02,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:58:02,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 175093972, now seen corresponding path program 1 times [2025-03-09 01:58:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915207075] [2025-03-09 01:58:02,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:58:02,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:58:02,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,615 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 01:58:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915207075] [2025-03-09 01:58:02,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915207075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949546063] [2025-03-09 01:58:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:02,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:02,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,616 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 01:58:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,636 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-09 01:58:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:02,636 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), 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 9 [2025-03-09 01:58:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,637 INFO L225 Difference]: With dead ends: 21 [2025-03-09 01:58:02,638 INFO L226 Difference]: Without dead ends: 20 [2025-03-09 01:58:02,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,638 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-09 01:58:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-09 01:58:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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 01:58:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-09 01:58:02,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 9 [2025-03-09 01:58:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,644 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-09 01:58:02,644 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), 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 01:58:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-09 01:58:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:58:02,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:58:02,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1132945815, now seen corresponding path program 1 times [2025-03-09 01:58:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582251403] [2025-03-09 01:58:02,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:58:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:58:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,689 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 01:58:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582251403] [2025-03-09 01:58:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582251403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991828523] [2025-03-09 01:58:02,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:02,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,690 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 01:58:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,708 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 01:58:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-09 01:58:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,708 INFO L225 Difference]: With dead ends: 19 [2025-03-09 01:58:02,708 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 01:58:02,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:02,711 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 01:58:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 01:58:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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 01:58:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-09 01:58:02,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 10 [2025-03-09 01:58:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,714 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-09 01:58:02,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 01:58:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-09 01:58:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:58:02,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:58:02,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:02,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1613898111, now seen corresponding path program 1 times [2025-03-09 01:58:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776098083] [2025-03-09 01:58:02,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:58:02,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:58:02,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776098083] [2025-03-09 01:58:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776098083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412587285] [2025-03-09 01:58:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:02,783 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 01:58:02,785 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 01:58:02,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:58:02,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:58:02,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:58:02,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412587285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:02,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:58:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244021355] [2025-03-09 01:58:02,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:58:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:58:02,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:58:02,925 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 01:58:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,954 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-09 01:58:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 15 [2025-03-09 01:58:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,955 INFO L225 Difference]: With dead ends: 41 [2025-03-09 01:58:02,955 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 01:58:02,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:58:02,955 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 01:58:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-09 01:58:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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 01:58:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-09 01:58:02,961 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 15 [2025-03-09 01:58:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-09 01:58:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 01:58:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-09 01:58:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:58:02,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,969 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 01:58:03,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1508766130, now seen corresponding path program 1 times [2025-03-09 01:58:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988738555] [2025-03-09 01:58:03,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:03,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:58:03,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:58:03,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988738555] [2025-03-09 01:58:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988738555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291997334] [2025-03-09 01:58:03,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:03,246 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 01:58:03,247 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 01:58:03,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:58:03,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:58:03,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:58:03,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291997334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:03,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 01:58:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051442117] [2025-03-09 01:58:03,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:58:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:03,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:58:03,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:58:03,499 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 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 01:58:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:03,669 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-09 01:58:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:58:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 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 16 [2025-03-09 01:58:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:03,670 INFO L225 Difference]: With dead ends: 48 [2025-03-09 01:58:03,671 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 01:58:03,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:58:03,671 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:03,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 01:58:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-09 01:58:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 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 01:58:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2025-03-09 01:58:03,675 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 16 [2025-03-09 01:58:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:03,675 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2025-03-09 01:58:03,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 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 01:58:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2025-03-09 01:58:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 01:58:03,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:03,676 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 01:58:03,683 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 01:58:03,876 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,SelfDestructingSolverStorable7 [2025-03-09 01:58:03,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1174775993, now seen corresponding path program 2 times [2025-03-09 01:58:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903928588] [2025-03-09 01:58:03,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:03,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 01:58:03,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 36 statements. [2025-03-09 01:58:03,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:58:03,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-09 01:58:03,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903928588] [2025-03-09 01:58:03,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903928588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359196560] [2025-03-09 01:58:03,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:03,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:03,917 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 01:58:03,919 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 01:58:03,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 01:58:03,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 36 statements. [2025-03-09 01:58:03,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:58:03,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:58:03,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-09 01:58:03,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-09 01:58:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359196560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:04,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-09 01:58:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028334928] [2025-03-09 01:58:04,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:04,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:04,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:04,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:04,033 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 01:58:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:04,046 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2025-03-09 01:58:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 36 [2025-03-09 01:58:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:04,048 INFO L225 Difference]: With dead ends: 46 [2025-03-09 01:58:04,048 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:58:04,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:58:04,050 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:04,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:58:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:58:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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 01:58:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2025-03-09 01:58:04,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 36 [2025-03-09 01:58:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:04,056 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2025-03-09 01:58:04,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 01:58:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2025-03-09 01:58:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 01:58:04,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:04,057 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1] [2025-03-09 01:58:04,063 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 01:58:04,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:58:04,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1715677390, now seen corresponding path program 2 times [2025-03-09 01:58:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374946815] [2025-03-09 01:58:04,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:04,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:58:04,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:58:04,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:04,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-09 01:58:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374946815] [2025-03-09 01:58:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374946815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580451580] [2025-03-09 01:58:04,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:04,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:04,495 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 01:58:04,496 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 01:58:04,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:58:04,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:58:04,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:58:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:04,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580451580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:05,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 19] total 40 [2025-03-09 01:58:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734343492] [2025-03-09 01:58:05,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:05,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-09 01:58:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-09 01:58:05,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 01:58:05,347 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 41 states, 40 states have (on average 2.375) internal successors, (95), 41 states have internal predecessors, (95), 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 01:58:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,014 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2025-03-09 01:58:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:58:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.375) internal successors, (95), 41 states have internal predecessors, (95), 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 44 [2025-03-09 01:58:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,016 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:58:06,016 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:58:06,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=510, Invalid=3030, Unknown=0, NotChecked=0, Total=3540 [2025-03-09 01:58:06,018 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 86 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 23 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:58:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:58:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:58:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 01:58:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:58:06,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-03-09 01:58:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,020 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:58:06,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.375) internal successors, (95), 41 states have internal predecessors, (95), 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 01:58:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:58:06,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 01:58:06,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 01:58:06,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:06,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:06,229 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:06,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:58:06,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:58:06,327 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-09 01:58:06,328 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-09 01:58:06,328 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-09 01:58:06,329 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-09 01:58:06,329 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-09 01:58:06,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:58:06 BoogieIcfgContainer [2025-03-09 01:58:06,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:58:06,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:58:06,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:58:06,331 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:58:06,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:58:02" (3/4) ... [2025-03-09 01:58:06,333 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:58:06,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 01:58:06,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:58:06,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:58:06,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:58:06,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:58:06,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:58:06,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:58:06,397 INFO L158 Benchmark]: Toolchain (without parser) took 4683.96ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 85.8MB in the end (delta: 46.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-03-09 01:58:06,398 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:58:06,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 123.77ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 122.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:58:06,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.74ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:58:06,398 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.9MB in the end (delta: 882.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:58:06,399 INFO L158 Benchmark]: IcfgBuilder took 190.17ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 108.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:58:06,399 INFO L158 Benchmark]: TraceAbstraction took 4260.68ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 92.7MB in the end (delta: 15.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2025-03-09 01:58:06,399 INFO L158 Benchmark]: Witness Printer took 65.61ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 85.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:58:06,401 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 123.77ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 122.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.74ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.9MB in the end (delta: 882.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 190.17ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 108.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4260.68ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 92.7MB in the end (delta: 15.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Witness Printer took 65.61ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 85.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 * 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 - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 28 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 85 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=8, InterpolantAutomatonStates: 73, 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, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 265 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 10 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 247/519 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 24]: Location Invariant Derived location invariant: ((((((n <= 2147483647) && (0 <= ((long long) 2147483647 + k))) && (k <= 2147483647)) && (0 <= j)) && (n <= ((long long) j + k))) && (1 <= n)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:58:06,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE