./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.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 cc20d196113d3ae541f6b6d9413b3adf505f83f475b90cd277ec788090ea4b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:55:51,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:55:52,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:55:52,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:55:52,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:55:52,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:55:52,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:55:52,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:55:52,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:55:52,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:55:52,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:55:52,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:55:52,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:55:52,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:55:52,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:55:52,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:55:52,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:55:52,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:55:52,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:55:52,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:55:52,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:55:52,077 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 -> cc20d196113d3ae541f6b6d9413b3adf505f83f475b90cd277ec788090ea4b3d [2025-03-04 10:55:52,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:55:52,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:55:52,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:55:52,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:55:52,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:55:52,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i [2025-03-04 10:55:53,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dd96856/560471d6a7b641ad939a88240a09f872/FLAG74d7d066f [2025-03-04 10:55:53,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:55:53,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i [2025-03-04 10:55:53,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dd96856/560471d6a7b641ad939a88240a09f872/FLAG74d7d066f [2025-03-04 10:55:54,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dd96856/560471d6a7b641ad939a88240a09f872 [2025-03-04 10:55:54,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:55:54,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:55:54,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:55:54,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:55:54,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:55:54,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54, skipping insertion in model container [2025-03-04 10:55:54,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:55:54,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:55:54,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:55:54,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:55:54,200 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:55:54,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54 WrapperNode [2025-03-04 10:55:54,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:55:54,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:55:54,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:55:54,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:55:54,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,219 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 10:55:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:55:54,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:55:54,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:55:54,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:55:54,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,231 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-04 10:55:54,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:55:54,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:55:54,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:55:54,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:55:54,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (1/1) ... [2025-03-04 10:55:54,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:55:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:54,258 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-04 10:55:54,260 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-04 10:55:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:55:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:55:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:55:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:55:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:55:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:55:54,308 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:55:54,309 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:55:54,407 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 10:55:54,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:55:54,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:55:54,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:55:54,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:54 BoogieIcfgContainer [2025-03-04 10:55:54,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:55:54,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:55:54,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:55:54,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:55:54,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:55:54" (1/3) ... [2025-03-04 10:55:54,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f39bd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:55:54, skipping insertion in model container [2025-03-04 10:55:54,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:54" (2/3) ... [2025-03-04 10:55:54,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f39bd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:55:54, skipping insertion in model container [2025-03-04 10:55:54,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:54" (3/3) ... [2025-03-04 10:55:54,424 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound20.i [2025-03-04 10:55:54,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:55:54,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_unwindbound20.i that has 2 procedures, 30 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 10:55:54,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:55:54,489 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;@facd199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:55:54,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:55:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:55:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:55:54,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:54,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:55:54,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1907551, now seen corresponding path program 1 times [2025-03-04 10:55:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814313355] [2025-03-04 10:55:54,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:54,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:55:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:55:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:54,652 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-04 10:55:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814313355] [2025-03-04 10:55:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814313355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:55:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003994666] [2025-03-04 10:55:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:55:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:54,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:55:54,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:55:54,678 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-04 10:55:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:54,749 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2025-03-04 10:55:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:55:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-04 10:55:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:54,755 INFO L225 Difference]: With dead ends: 55 [2025-03-04 10:55:54,755 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:55:54,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:54,760 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:54,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:55:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-03-04 10:55:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 10:55:54,789 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2025-03-04 10:55:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 10:55:54,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-04 10:55:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 10:55:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:55:54,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:54,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:55:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:55:54,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 59134076, now seen corresponding path program 1 times [2025-03-04 10:55:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638927250] [2025-03-04 10:55:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:54,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:55:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:55:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:54,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:54,847 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-04 10:55:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638927250] [2025-03-04 10:55:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638927250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:54,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:55:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054623866] [2025-03-04 10:55:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:55:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:54,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:55:54,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:55:54,850 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-04 10:55:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:54,888 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 10:55:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:55:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-04 10:55:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:54,889 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:55:54,890 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:55:54,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:54,890 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:54,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:55:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 10:55:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 10:55:54,897 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2025-03-04 10:55:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 10:55:54,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-04 10:55:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 10:55:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:55:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:54,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:54,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:55:54,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1051614391, now seen corresponding path program 1 times [2025-03-04 10:55:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628459576] [2025-03-04 10:55:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:54,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:55:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:55:54,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:54,969 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-04 10:55:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:54,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628459576] [2025-03-04 10:55:54,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628459576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:54,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317919305] [2025-03-04 10:55:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:54,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:55:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:54,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:55:54,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:54,972 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-04 10:55:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:55,021 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-04 10:55:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:55:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-04 10:55:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:55,021 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:55:55,021 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:55:55,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:55:55,022 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:55,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:55:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 10:55:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 10:55:55,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-03-04 10:55:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 10:55:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-04 10:55:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 10:55:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:55:55,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:55,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:55,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:55:55,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1759692264, now seen corresponding path program 1 times [2025-03-04 10:55:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-03-04 10:55:55,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:55:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:55:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:55,096 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-04 10:55:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-03-04 10:55:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305814731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178145014] [2025-03-04 10:55:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:55:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:55:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:55,098 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04 10:55:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:55,152 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-04 10:55:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:55:55,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04 10:55:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:55,153 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:55:55,153 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:55:55,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:55:55,154 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:55,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:55:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-04 10:55:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 10:55:55,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2025-03-04 10:55:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:55,157 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 10:55:55,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04 10:55:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 10:55:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:55:55,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:55,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:55,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:55:55,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:55,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1759620766, now seen corresponding path program 1 times [2025-03-04 10:55:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:55,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294090723] [2025-03-04 10:55:55,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:55,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:55:55,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:55:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:55,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294090723] [2025-03-04 10:55:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294090723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046470420] [2025-03-04 10:55:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:55,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:55,221 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-04 10:55:55,231 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-04 10:55:55,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:55:55,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:55:55,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:55,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:55,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:55:55,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:55,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:55:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046470420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:55:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-04 10:55:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126466499] [2025-03-04 10:55:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:55,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:55,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:55,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:55:55,320 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-04 10:55:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:55,360 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-04 10:55:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:55:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-04 10:55:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:55,361 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:55:55,361 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:55:55,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:55:55,362 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:55,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:55:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-04 10:55:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 10:55:55,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2025-03-04 10:55:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:55,366 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 10:55:55,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-04 10:55:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 10:55:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:55:55,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:55,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:55,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:55:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:55,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1391453049, now seen corresponding path program 1 times [2025-03-04 10:55:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949940975] [2025-03-04 10:55:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:55:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:55:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949940975] [2025-03-04 10:55:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949940975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463454242] [2025-03-04 10:55:55,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:55,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:55,630 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-04 10:55:55,630 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-04 10:55:55,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:55:55,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:55:55,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:55,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:55,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:55:55,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:55,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463454242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:55,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:55:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091931900] [2025-03-04 10:55:55,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:55,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:55:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:55,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:55:55,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:55:55,724 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-04 10:55:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:55,827 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-03-04 10:55:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:55:55,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 14 [2025-03-04 10:55:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:55,828 INFO L225 Difference]: With dead ends: 61 [2025-03-04 10:55:55,828 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:55:55,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:55:55,829 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:55,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:55:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-03-04 10:55:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-03-04 10:55:55,833 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2025-03-04 10:55:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:55,833 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-04 10:55:55,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-04 10:55:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-03-04 10:55:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:55:55,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:55,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:55,841 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-04 10:55:56,034 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,SelfDestructingSolverStorable5 [2025-03-04 10:55:56,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 184539378, now seen corresponding path program 1 times [2025-03-04 10:55:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870837950] [2025-03-04 10:55:56,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:55:56,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:55:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:56,104 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-04 10:55:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870837950] [2025-03-04 10:55:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870837950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761050249] [2025-03-04 10:55:56,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:56,107 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-04 10:55:56,108 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-04 10:55:56,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:55:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:55:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:56,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:55:56,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:56,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761050249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:56,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-04 10:55:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235818780] [2025-03-04 10:55:56,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:55:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:56,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:55:56,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:55:56,281 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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-04 10:55:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:56,497 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-04 10:55:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:55:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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-04 10:55:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:56,507 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:55:56,507 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:55:56,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:55:56,507 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:56,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:55:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 10:55:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:55:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-03-04 10:55:56,518 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2025-03-04 10:55:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-04 10:55:56,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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-04 10:55:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-03-04 10:55:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:55:56,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:56,519 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:56,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:55:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:56,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:56,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1463980902, now seen corresponding path program 1 times [2025-03-04 10:55:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554537007] [2025-03-04 10:55:56,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:56,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:55:56,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:55:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:55:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554537007] [2025-03-04 10:55:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554537007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442808593] [2025-03-04 10:55:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:56,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:56,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:56,904 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-04 10:55:56,906 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-04 10:55:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:55:56,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:55:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:56,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:56,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:55:56,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:57,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:55:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442808593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:57,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-04 10:55:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776647786] [2025-03-04 10:55:57,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:55:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:55:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:55:57,293 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:55:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:57,789 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2025-03-04 10:55:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:55:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 43 [2025-03-04 10:55:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:57,791 INFO L225 Difference]: With dead ends: 216 [2025-03-04 10:55:57,791 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 10:55:57,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 10:55:57,793 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 151 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:57,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 204 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 10:55:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 162. [2025-03-04 10:55:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:55:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2025-03-04 10:55:57,805 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 43 [2025-03-04 10:55:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2025-03-04 10:55:57,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:55:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2025-03-04 10:55:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:55:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:57,807 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:55:57,813 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-04 10:55:58,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:58,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:58,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1147394451, now seen corresponding path program 1 times [2025-03-04 10:55:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394007260] [2025-03-04 10:55:58,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:58,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:55:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:55:58,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:55:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394007260] [2025-03-04 10:55:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394007260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326331612] [2025-03-04 10:55:58,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:58,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:55:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:55:58,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:55:58,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:58,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:58,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:55:58,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:55:58,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:55:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326331612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:58,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:58,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-04 10:55:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85988171] [2025-03-04 10:55:58,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:55:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:58,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:55:58,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:55:58,364 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:55:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:58,618 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2025-03-04 10:55:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:55:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-03-04 10:55:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:58,620 INFO L225 Difference]: With dead ends: 242 [2025-03-04 10:55:58,620 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 10:55:58,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:55:58,621 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:58,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 151 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 10:55:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2025-03-04 10:55:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 167 states have internal predecessors, (191), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:55:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2025-03-04 10:55:58,641 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 51 [2025-03-04 10:55:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2025-03-04 10:55:58,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:55:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2025-03-04 10:55:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:55:58,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:58,644 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:55:58,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:55:58,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:58,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -272041773, now seen corresponding path program 2 times [2025-03-04 10:55:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-04 10:55:58,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:58,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 10:55:58,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:55:58,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:58,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 10:55:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:58,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-04 10:55:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87074706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:55:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938547285] [2025-03-04 10:55:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:58,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:58,954 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:58,981 INFO L93 Difference]: Finished difference Result 218 states and 243 transitions. [2025-03-04 10:55:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:55:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2025-03-04 10:55:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:58,983 INFO L225 Difference]: With dead ends: 218 [2025-03-04 10:55:58,983 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 10:55:58,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:58,984 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:58,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 10:55:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2025-03-04 10:55:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.1219512195121952) internal successors, (138), 123 states have internal predecessors, (138), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:55:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-03-04 10:55:59,014 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 81 [2025-03-04 10:55:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:59,014 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-03-04 10:55:59,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:55:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-03-04 10:55:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:55:59,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:59,017 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:55:59,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:55:59,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:59,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2057192946, now seen corresponding path program 1 times [2025-03-04 10:55:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:59,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827353027] [2025-03-04 10:55:59,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:59,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:55:59,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:55:59,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:55:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827353027] [2025-03-04 10:55:59,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827353027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:59,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948829480] [2025-03-04 10:55:59,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:59,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:59,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:59,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:59,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:55:59,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:55:59,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:55:59,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:59,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:59,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:55:59,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:56:00,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:56:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948829480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:00,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:00,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-03-04 10:56:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701474960] [2025-03-04 10:56:00,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-04 10:56:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:00,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-04 10:56:00,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:56:00,690 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:56:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:02,095 INFO L93 Difference]: Finished difference Result 526 states and 592 transitions. [2025-03-04 10:56:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-04 10:56:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 103 [2025-03-04 10:56:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:02,099 INFO L225 Difference]: With dead ends: 526 [2025-03-04 10:56:02,099 INFO L226 Difference]: Without dead ends: 525 [2025-03-04 10:56:02,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4405, Invalid=11597, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:56:02,106 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 448 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:02,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 330 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:56:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-04 10:56:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 318. [2025-03-04 10:56:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 263 states have (on average 1.11787072243346) internal successors, (294), 263 states have internal predecessors, (294), 27 states have call successors, (27), 27 states have call predecessors, (27), 27 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:56:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 348 transitions. [2025-03-04 10:56:02,140 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 348 transitions. Word has length 103 [2025-03-04 10:56:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:02,140 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 348 transitions. [2025-03-04 10:56:02,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:56:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 348 transitions. [2025-03-04 10:56:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 10:56:02,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:02,147 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 10:56:02,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:56:02,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:02,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 832412440, now seen corresponding path program 2 times [2025-03-04 10:56:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-03-04 10:56:02,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:56:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:02,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-04 10:56:02,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 10:56:02,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:56:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-03-04 10:56:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-03-04 10:56:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758000255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:02,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:56:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793646219] [2025-03-04 10:56:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:56:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:02,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:56:02,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:56:02,582 INFO L87 Difference]: Start difference. First operand 318 states and 348 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:56:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:02,613 INFO L93 Difference]: Finished difference Result 322 states and 352 transitions. [2025-03-04 10:56:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:56:02,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 218 [2025-03-04 10:56:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:02,614 INFO L225 Difference]: With dead ends: 322 [2025-03-04 10:56:02,614 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:56:02,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:56:02,615 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:02,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:56:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:56:02,615 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-04 10:56:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:56:02,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2025-03-04 10:56:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:02,615 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:56:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:56:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:56:02,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:56:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 10:56:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 10:56:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 10:56:02,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 10:56:02,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:56:02,621 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:02,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:56:03,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:56:03,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:56:03 BoogieIcfgContainer [2025-03-04 10:56:03,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:56:03,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:56:03,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:56:03,142 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:56:03,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:54" (3/4) ... [2025-03-04 10:56:03,144 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:56:03,148 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:56:03,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:56:03,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:56:03,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:56:03,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:56:03,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:56:03,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:56:03,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:56:03,220 INFO L158 Benchmark]: Toolchain (without parser) took 9178.71ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.0MB in the beginning and 155.9MB in the end (delta: -43.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,220 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:03,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.97ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.73ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:03,221 INFO L158 Benchmark]: Boogie Preprocessor took 16.52ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.7MB in the end (delta: 988.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,221 INFO L158 Benchmark]: IcfgBuilder took 181.41ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,221 INFO L158 Benchmark]: TraceAbstraction took 8722.20ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 86.4MB in the beginning and 160.6MB in the end (delta: -74.2MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,222 INFO L158 Benchmark]: Witness Printer took 77.04ms. Allocated memory is still 218.1MB. Free memory was 160.6MB in the beginning and 155.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:03,223 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.97ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.73ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.52ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.7MB in the end (delta: 988.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 181.41ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8722.20ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 86.4MB in the beginning and 160.6MB in the end (delta: -74.2MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 77.04ms. Allocated memory is still 218.1MB. Free memory was 160.6MB in the beginning and 155.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: 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 2 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 896 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 896 mSDsluCounter, 1278 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1035 IncrementalHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 201 mSDtfsCounter, 1035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=11, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 799 NumberOfCodeBlocks, 799 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060 SizeOfPredicates, 42 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 2348/3393 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 4 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 20)) || ((21 <= counter) && (counter <= 2147483645))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:56:03,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE