./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/divbin_unwindbound2.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 ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:11:42,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:11:42,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:11:42,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:11:42,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:11:42,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:11:42,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:11:42,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:11:42,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:11:42,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:11:42,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:11:42,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:11:42,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:11:42,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:11:42,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:11:42,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:11:42,286 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:11:42,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:42,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:11:42,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:11:42,287 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 -> ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e [2025-03-17 15:11:42,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:11:42,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:11:42,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:11:42,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:11:42,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:11:42,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2025-03-17 15:11:43,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee5266e1/5458af201f68431a863ecf3ab7e6c39f/FLAG25616b9db [2025-03-17 15:11:43,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:11:43,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2025-03-17 15:11:43,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee5266e1/5458af201f68431a863ecf3ab7e6c39f/FLAG25616b9db [2025-03-17 15:11:43,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee5266e1/5458af201f68431a863ecf3ab7e6c39f [2025-03-17 15:11:43,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:11:43,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:11:43,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:43,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:11:43,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:11:43,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:43" (1/1) ... [2025-03-17 15:11:43,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c548629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:43, skipping insertion in model container [2025-03-17 15:11:43,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:43" (1/1) ... [2025-03-17 15:11:43,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:11:44,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:44,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:11:44,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:44,118 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:11:44,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44 WrapperNode [2025-03-17 15:11:44,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:44,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:44,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:11:44,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:11:44,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,143 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-17 15:11:44,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:44,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:11:44,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:11:44,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:11:44,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,166 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-17 15:11:44,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:11:44,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:11:44,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:11:44,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:11:44,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:44,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:11:44,212 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-17 15:11:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:11:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:11:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:11:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:11:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:11:44,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:11:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:11:44,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:11:44,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:11:44,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:11:44,435 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 15:11:44,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:11:44,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:11:44,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:11:44,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:44 BoogieIcfgContainer [2025-03-17 15:11:44,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:11:44,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:11:44,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:11:44,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:11:44,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:11:43" (1/3) ... [2025-03-17 15:11:44,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b6b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:44, skipping insertion in model container [2025-03-17 15:11:44,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (2/3) ... [2025-03-17 15:11:44,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b6b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:44, skipping insertion in model container [2025-03-17 15:11:44,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:44" (3/3) ... [2025-03-17 15:11:44,451 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2025-03-17 15:11:44,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:11:44,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound2.i that has 3 procedures, 34 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 15:11:44,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:11:44,514 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;@2ee8cc4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:11:44,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:11:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:11:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:44,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:44,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:44,522 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-17 15:11:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash -265482271, now seen corresponding path program 1 times [2025-03-17 15:11:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464355455] [2025-03-17 15:11:44,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:44,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:44,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:44,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:44,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:11:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464355455] [2025-03-17 15:11:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464355455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301251659] [2025-03-17 15:11:44,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:44,633 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-17 15:11:44,635 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-17 15:11:44,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:44,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:44,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:44,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:44,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:11:44,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:11:44,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301251659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:11:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93323818] [2025-03-17 15:11:44,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:11:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:44,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:11:44,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:11:44,726 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:11:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:44,741 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2025-03-17 15:11:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:11:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-17 15:11:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:44,746 INFO L225 Difference]: With dead ends: 65 [2025-03-17 15:11:44,746 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 15:11:44,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:11:44,751 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:44,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 15:11:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 15:11:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-17 15:11:44,779 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2025-03-17 15:11:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:44,779 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 15:11:44,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:11:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-17 15:11:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:44,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:44,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:44,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:44,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 15:11:44,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:44,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2033804479, now seen corresponding path program 1 times [2025-03-17 15:11:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:44,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053420248] [2025-03-17 15:11:44,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:44,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:44,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:45,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053420248] [2025-03-17 15:11:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053420248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294396651] [2025-03-17 15:11:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:45,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:45,078 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,123 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 15:11:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:11:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-17 15:11:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,124 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:11:45,124 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:11:45,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 15:11:45,125 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:45,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:11:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-17 15:11:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-17 15:11:45,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2025-03-17 15:11:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,133 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-17 15:11:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-17 15:11:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:11:45,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:11:45,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1376570584, now seen corresponding path program 1 times [2025-03-17 15:11:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164440119] [2025-03-17 15:11:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:11:45,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:11:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164440119] [2025-03-17 15:11:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164440119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932874211] [2025-03-17 15:11:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:45,198 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,226 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-17 15:11:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-17 15:11:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,227 INFO L225 Difference]: With dead ends: 45 [2025-03-17 15:11:45,227 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:11:45,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 15:11:45,228 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 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-17 15:11:45,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:11:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 15:11:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-17 15:11:45,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2025-03-17 15:11:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,232 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-17 15:11:45,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-17 15:11:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:11:45,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:11:45,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1297720685, now seen corresponding path program 1 times [2025-03-17 15:11:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039821674] [2025-03-17 15:11:45,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:11:45,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:11:45,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039821674] [2025-03-17 15:11:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039821674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080645291] [2025-03-17 15:11:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:45,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:45,331 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,381 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-17 15:11:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:11:45,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-17 15:11:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,382 INFO L225 Difference]: With dead ends: 31 [2025-03-17 15:11:45,382 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 15:11:45,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-17 15:11:45,382 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:45,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 59 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 15:11:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 15:11:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-17 15:11:45,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2025-03-17 15:11:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,386 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-17 15:11:45,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-17 15:11:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:45,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:11:45,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:45,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1574635590, now seen corresponding path program 1 times [2025-03-17 15:11:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946709352] [2025-03-17 15:11:45,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946709352] [2025-03-17 15:11:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946709352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283414803] [2025-03-17 15:11:45,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:45,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:45,451 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,501 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-03-17 15:11:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:11:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 15:11:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,502 INFO L225 Difference]: With dead ends: 40 [2025-03-17 15:11:45,502 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 15:11:45,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-17 15:11:45,503 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:45,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 15:11:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-17 15:11:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-17 15:11:45,513 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2025-03-17 15:11:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,514 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 15:11:45,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-17 15:11:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:11:45,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1574564092, now seen corresponding path program 1 times [2025-03-17 15:11:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670917941] [2025-03-17 15:11:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670917941] [2025-03-17 15:11:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670917941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:45,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153788014] [2025-03-17 15:11:45,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:45,580 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-17 15:11:45,581 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-17 15:11:45,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:11:45,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153788014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 15:11:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013966123] [2025-03-17 15:11:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:45,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:45,656 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,690 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-17 15:11:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 15:11:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,691 INFO L225 Difference]: With dead ends: 38 [2025-03-17 15:11:45,691 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 15:11:45,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:11:45,692 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:45,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 15:11:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-03-17 15:11:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 15:11:45,696 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2025-03-17 15:11:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,696 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 15:11:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-17 15:11:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:11:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:45,901 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-17 15:11:45,901 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-17 15:11:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -222621797, now seen corresponding path program 1 times [2025-03-17 15:11:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062257325] [2025-03-17 15:11:45,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:45,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:45,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062257325] [2025-03-17 15:11:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062257325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566951524] [2025-03-17 15:11:45,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:45,951 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-17 15:11:45,952 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-17 15:11:45,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:45,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:11:45,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:46,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:46,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566951524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:46,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:46,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-03-17 15:11:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024474462] [2025-03-17 15:11:46,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:46,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:46,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:46,060 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:11:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:46,102 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-17 15:11:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:11:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2025-03-17 15:11:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:46,103 INFO L225 Difference]: With dead ends: 49 [2025-03-17 15:11:46,104 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 15:11:46,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:46,104 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:46,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 15:11:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 15:11:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-17 15:11:46,109 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2025-03-17 15:11:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:46,109 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-17 15:11:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:11:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-17 15:11:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:11:46,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:46,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:46,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:11:46,313 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-17 15:11:46,313 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-17 15:11:46,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1687826702, now seen corresponding path program 1 times [2025-03-17 15:11:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:46,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438915502] [2025-03-17 15:11:46,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:46,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438915502] [2025-03-17 15:11:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438915502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416108982] [2025-03-17 15:11:46,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:46,373 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-17 15:11:46,374 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-17 15:11:46,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:46,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:46,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:11:46,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:46,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416108982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:46,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-17 15:11:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914925051] [2025-03-17 15:11:46,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:46,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:11:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:46,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:11:46,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:11:46,532 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:11:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:46,749 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-17 15:11:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 15:11:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-17 15:11:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:46,750 INFO L225 Difference]: With dead ends: 63 [2025-03-17 15:11:46,750 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 15:11:46,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:11:46,751 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:46,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 174 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:11:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 15:11:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-03-17 15:11:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:11:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-03-17 15:11:46,759 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 25 [2025-03-17 15:11:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-03-17 15:11:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:11:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-03-17 15:11:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:11:46,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:46,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:46,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:11:46,961 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-17 15:11:46,962 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-17 15:11:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1266576591, now seen corresponding path program 1 times [2025-03-17 15:11:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303174397] [2025-03-17 15:11:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:46,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:11:46,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:11:46,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 15:11:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303174397] [2025-03-17 15:11:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303174397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456767922] [2025-03-17 15:11:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:47,061 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:11:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,094 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-03-17 15:11:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-03-17 15:11:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,096 INFO L225 Difference]: With dead ends: 85 [2025-03-17 15:11:47,096 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 15:11:47,096 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-17 15:11:47,096 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:47,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 15:11:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-03-17 15:11:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:11:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 15:11:47,105 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 51 [2025-03-17 15:11:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,106 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 15:11:47,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:11:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 15:11:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:11:47,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:11:47,109 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-17 15:11:47,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 972281457, now seen corresponding path program 1 times [2025-03-17 15:11:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916231017] [2025-03-17 15:11:47,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:47,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:47,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:11:47,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916231017] [2025-03-17 15:11:47,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916231017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:47,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491405540] [2025-03-17 15:11:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:47,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:47,250 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-17 15:11:47,252 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-17 15:11:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:47,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:47,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:11:47,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:11:47,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:11:47,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491405540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:47,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:47,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-03-17 15:11:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878221347] [2025-03-17 15:11:47,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:11:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:11:47,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:11:47,400 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:11:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,463 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-03-17 15:11:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:11:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 53 [2025-03-17 15:11:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,464 INFO L225 Difference]: With dead ends: 53 [2025-03-17 15:11:47,464 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:11:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:11:47,464 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:47,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:11:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:11:47,465 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-17 15:11:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:11:47,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-17 15:11:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,465 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:11:47,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:11:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:11:47,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:11:47,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:11:47,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:11:47,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:11:47,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:11:47,476 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-17 15:11:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 15:11:47,672 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:11:47,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:11:47,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:11:47 BoogieIcfgContainer [2025-03-17 15:11:47,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:11:47,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:11:47,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:11:47,748 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:11:47,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:44" (3/4) ... [2025-03-17 15:11:47,750 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:11:47,754 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:11:47,754 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:11:47,756 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 15:11:47,756 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:11:47,756 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:11:47,757 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:11:47,817 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:11:47,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:11:47,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:11:47,819 INFO L158 Benchmark]: Toolchain (without parser) took 3862.01ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 56.0MB in the end (delta: 67.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 15:11:47,819 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:47,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.34ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:47,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.91ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.6MB in the end (delta: 742.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:47,820 INFO L158 Benchmark]: Boogie Preprocessor took 30.36ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:47,820 INFO L158 Benchmark]: IcfgBuilder took 265.94ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.0MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:11:47,820 INFO L158 Benchmark]: TraceAbstraction took 3303.74ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 61.4MB in the end (delta: 35.8MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-17 15:11:47,821 INFO L158 Benchmark]: Witness Printer took 70.38ms. Allocated memory is still 167.8MB. Free memory was 61.4MB in the beginning and 56.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:47,822 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.58ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.34ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.91ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.6MB in the end (delta: 742.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.36ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.94ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.0MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3303.74ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 61.4MB in the end (delta: 35.8MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 70.38ms. Allocated memory is still 167.8MB. Free memory was 61.4MB in the beginning and 56.0MB in the end (delta: 5.4MB). 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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 3 procedures, 34 locations, 49 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 563 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 245 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 223 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=8, InterpolantAutomatonStates: 74, 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, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 889 SizeOfPredicates, 12 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 232/261 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: 36]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 2)) || (counter == 0)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:11:47,837 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